Base | Representation |
---|---|
bin | 1001001110100001010011… |
… | …0001001111000100001100 |
3 | 1022220212011202110221120022 |
4 | 2103220110301033010030 |
5 | 2312204041132013421 |
6 | 33324324330041312 |
7 | 2064646034262140 |
oct | 223502461170414 |
9 | 38825152427508 |
10 | 10145061204236 |
11 | 3261550628882 |
12 | 117a220579238 |
13 | 5878a145820a |
14 | 2710489d1220 |
15 | 128d6a15a7ab |
hex | 93a14c4f10c |
10145061204236 has 12 divisors (see below), whose sum is σ = 20290122408528. Its totient is φ = 4347883373232.
The previous prime is 10145061204233. The next prime is 10145061204247. The reversal of 10145061204236 is 63240216054101.
10145061204236 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 10145061204196 and 10145061204205.
It is not an unprimeable number, because it can be changed into a prime (10145061204233) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 181161807191 + ... + 181161807246.
It is an arithmetic number, because the mean of its divisors is an integer number (1690843534044).
Almost surely, 210145061204236 is an apocalyptic number.
It is an amenable number.
10145061204236 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.
10145061204236 is a wasteful number, since it uses less digits than its factorization.
10145061204236 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 362323614448 (or 362323614446 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 35.
Adding to 10145061204236 its reverse (63240216054101), we get a palindrome (73385277258337).
The spelling of 10145061204236 in words is "ten trillion, one hundred forty-five billion, sixty-one million, two hundred four thousand, two hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •