Base | Representation |
---|---|
bin | 111100010101010… |
… | …100100111010111 |
3 | 2121112200020010101 |
4 | 330111110213113 |
5 | 4033112104143 |
6 | 244235234531 |
7 | 34040514532 |
oct | 7425244727 |
9 | 2545606111 |
10 | 1012222423 |
11 | 47a411763 |
12 | 242ba8a47 |
13 | 1319294a4 |
14 | 9860da19 |
15 | 5dce7b4d |
hex | 3c5549d7 |
1012222423 has 4 divisors (see below), whose sum is σ = 1013604088. Its totient is φ = 1010840760.
The previous prime is 1012222417. The next prime is 1012222427. The reversal of 1012222423 is 3242222101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1012222423 - 29 = 1012221911 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1012222423.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012222427) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 689733 + ... + 691198.
It is an arithmetic number, because the mean of its divisors is an integer number (253401022).
Almost surely, 21012222423 is an apocalyptic number.
1012222423 is a deficient number, since it is larger than the sum of its proper divisors (1381665).
1012222423 is an equidigital number, since it uses as much as digits as its factorization.
1012222423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1381664.
The product of its (nonzero) digits is 384, while the sum is 19.
The square root of 1012222423 is about 31815.4431526578. The cubic root of 1012222423 is about 1004.0576541734.
Adding to 1012222423 its reverse (3242222101), we get a palindrome (4254444524).
The spelling of 1012222423 in words is "one billion, twelve million, two hundred twenty-two thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •