Base | Representation |
---|---|
bin | 10010101010111000… |
… | …10001111011101000 |
3 | 221212112211001120110 |
4 | 21111130101323220 |
5 | 131011443131212 |
6 | 4334340254320 |
7 | 503250406566 |
oct | 112534217350 |
9 | 27775731513 |
10 | 10023411432 |
11 | 4283a55401 |
12 | 1b389a13a0 |
13 | c397c65a8 |
14 | 6b12d8a36 |
15 | 3d9e84a3c |
hex | 255711ee8 |
10023411432 has 32 divisors (see below), whose sum is σ = 25092758880. Its totient is φ = 3336573120.
The previous prime is 10023411403. The next prime is 10023411467. The reversal of 10023411432 is 23411432001.
10023411432 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 10023411399 and 10023411408.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 267294 + ... + 302477.
It is an arithmetic number, because the mean of its divisors is an integer number (784148715).
Almost surely, 210023411432 is an apocalyptic number.
10023411432 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10023411432 is an abundant number, since it is smaller than the sum of its proper divisors (15069347448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10023411432 is a wasteful number, since it uses less digits than its factorization.
10023411432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 570513 (or 570509 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 10023411432 its reverse (23411432001), we get a palindrome (33434843433).
The spelling of 10023411432 in words is "ten billion, twenty-three million, four hundred eleven thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •