Base | Representation |
---|---|
bin | 10111010010010011100010… |
… | …101010100101101110011110 |
3 | 111102121120212021012200000220 |
4 | 113102103202222211232132 |
5 | 101410413312233134324 |
6 | 1001451514543502210 |
7 | 30400044454331214 |
oct | 2722234252455636 |
9 | 442546767180026 |
10 | 102413003021214 |
11 | 2a6a5124338686 |
12 | b5a03ab5b7966 |
13 | 451b673c07532 |
14 | 1b40b5c778cb4 |
15 | bc8ee59e2b79 |
hex | 5d24e2aa5b9e |
102413003021214 has 8 divisors (see below), whose sum is σ = 204826006042440. Its totient is φ = 34137667673736.
The previous prime is 102413003021209. The next prime is 102413003021237. The reversal of 102413003021214 is 412120300314201.
102413003021214 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
102413003021214 is an admirable number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8534416918429 + ... + 8534416918440.
It is an arithmetic number, because the mean of its divisors is an integer number (25603250755305).
Almost surely, 2102413003021214 is an apocalyptic number.
102413003021214 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.
102413003021214 is a wasteful number, since it uses less digits than its factorization.
102413003021214 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17068833836874.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 102413003021214 its reverse (412120300314201), we get a palindrome (514533303335415).
The spelling of 102413003021214 in words is "one hundred two trillion, four hundred thirteen billion, three million, twenty-one thousand, two hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •