Base | Representation |
---|---|
bin | 10010101000100110… |
… | …01001111001011110 |
3 | 221211012202011002000 |
4 | 21110103021321132 |
5 | 130442041221024 |
6 | 4332413343130 |
7 | 502625440224 |
oct | 112423117136 |
9 | 27735664060 |
10 | 10004242014 |
11 | 4274152108 |
12 | 1b32497aa6 |
13 | c35844240 |
14 | 6ac948b14 |
15 | 3d8449cc9 |
hex | 2544c9e5e |
10004242014 has 32 divisors (see below), whose sum is σ = 23941777440. Its totient is φ = 3078228096.
The previous prime is 10004241983. The next prime is 10004242019. The reversal of 10004242014 is 41024240001.
10004242014 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10004242019) 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 15 ways as a sum of consecutive naturals, for example, 7124827 + ... + 7126230.
It is an arithmetic number, because the mean of its divisors is an integer number (748180545).
Almost surely, 210004242014 is an apocalyptic number.
10004242014 is an abundant number, since it is smaller than the sum of its proper divisors (13937535426).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10004242014 is a wasteful number, since it uses less digits than its factorization.
10004242014 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14251081 (or 14251075 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 18.
Adding to 10004242014 its reverse (41024240001), we get a palindrome (51028482015).
The spelling of 10004242014 in words is "ten billion, four million, two hundred forty-two thousand, fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •