Base | Representation |
---|---|
bin | 10010101010111110… |
… | …10110001001001010 |
3 | 221212121022220000110 |
4 | 21111133112021022 |
5 | 131012144340424 |
6 | 4334405415150 |
7 | 503260264644 |
oct | 112537261112 |
9 | 27777286013 |
10 | 10024215114 |
11 | 4284454201 |
12 | 1b3910a4b6 |
13 | c39a18344 |
14 | 6b1467894 |
15 | 3da092c29 |
hex | 2557d624a |
10024215114 has 8 divisors (see below), whose sum is σ = 20048430240. Its totient is φ = 3341405036.
The previous prime is 10024215067. The next prime is 10024215161. The reversal of 10024215114 is 41151242001.
10024215114 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (10024215067) and next prime (10024215161).
It is a sphenic number, since it is the product of 3 distinct primes.
10024215114 is an admirable number.
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 3 ways as a sum of consecutive naturals, for example, 835351254 + ... + 835351265.
It is an arithmetic number, because the mean of its divisors is an integer number (2506053780).
Almost surely, 210024215114 is an apocalyptic number.
10024215114 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10024215114 is a wasteful number, since it uses less digits than its factorization.
10024215114 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1670702524.
The product of its (nonzero) digits is 320, while the sum is 21.
Adding to 10024215114 its reverse (41151242001), we get a palindrome (51175457115).
The spelling of 10024215114 in words is "ten billion, twenty-four million, two hundred fifteen thousand, one hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.149 sec. • engine limits •