Base | Representation |
---|---|
bin | 10111001100011101100010… |
… | …000011100010011110101000 |
3 | 111101012012021210101020021121 |
4 | 113030131202003202132220 |
5 | 101332323333303421440 |
6 | 1000543221335145024 |
7 | 30326036630354242 |
oct | 2714354203423650 |
9 | 441165253336247 |
10 | 102011413342120 |
11 | 2a55a885443907 |
12 | b5365b3b15174 |
13 | 44bc834138099 |
14 | 1b2954340b092 |
15 | bbd83e78834a |
hex | 5cc7620e27a8 |
102011413342120 has 32 divisors (see below), whose sum is σ = 229531302027720. Its totient is φ = 40803565868800.
The previous prime is 102011413342087. The next prime is 102011413342129. The reversal of 102011413342120 is 21243314110201.
It can be written as a sum of positive squares in 4 ways, for example, as 93900867540516 + 8110545801604 = 9690246^2 + 2847902^2 .
It is not an unprimeable number, because it can be changed into a prime (102011413342129) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 29578831 + ... + 32847070.
Almost surely, 2102011413342120 is an apocalyptic number.
102011413342120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102011413342120 is an abundant number, since it is smaller than the sum of its proper divisors (127519888685600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102011413342120 is a wasteful number, since it uses less digits than its factorization.
102011413342120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 62466765 (or 62466761 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 102011413342120 its reverse (21243314110201), we get a palindrome (123254727452321).
The spelling of 102011413342120 in words is "one hundred two trillion, eleven billion, four hundred thirteen million, three hundred forty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •