Base | Representation |
---|---|
bin | 111101100010100… |
… | …010110000001111 |
3 | 2122221202200022010 |
4 | 331202202300033 |
5 | 4103302343143 |
6 | 250241152303 |
7 | 34404545163 |
oct | 7542426017 |
9 | 2587680263 |
10 | 1032465423 |
11 | 48a888610 |
12 | 24992b693 |
13 | 135b963b2 |
14 | 9b19cca3 |
15 | 60995a33 |
hex | 3d8a2c0f |
1032465423 has 32 divisors (see below), whose sum is σ = 1579548672. Its totient is φ = 593762400.
The previous prime is 1032465419. The next prime is 1032465439. The reversal of 1032465423 is 3245642301.
1032465423 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Cunningham number, because it is equal to 321322-1.
It is not a de Polignac number, because 1032465423 - 22 = 1032465419 is a prime.
It is a Smith number, since the sum of its digits (30) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1032465463) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 91038 + ... + 101748.
It is an arithmetic number, because the mean of its divisors is an integer number (49360896).
Almost surely, 21032465423 is an apocalyptic number.
1032465423 is a deficient number, since it is larger than the sum of its proper divisors (547083249).
1032465423 is a wasteful number, since it uses less digits than its factorization.
1032465423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10875.
The product of its (nonzero) digits is 17280, while the sum is 30.
The square root of 1032465423 is about 32131.9999844392. Note that the first 4 decimals coincide. The cubic root of 1032465423 is about 1010.7067637540.
The spelling of 1032465423 in words is "one billion, thirty-two million, four hundred sixty-five thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •