Base | Representation |
---|---|
bin | 11011010110101111011100… |
… | …001100100101000000101110 |
3 | 120202222112012101011001012110 |
4 | 123112233130030211000232 |
5 | 111232124411420304402 |
6 | 1103513354530144450 |
7 | 34225053350052252 |
oct | 3326573414450056 |
9 | 522875171131173 |
10 | 120310023213102 |
11 | 3537521569a8a8 |
12 | 115b0a7b422126 |
13 | 52192569b27b8 |
14 | 219d071458262 |
15 | dd9816c5a56c |
hex | 6d6bdc32502e |
120310023213102 has 64 divisors (see below), whose sum is σ = 256790551117824. Its totient is φ = 37445621230080.
The previous prime is 120310023213073. The next prime is 120310023213131. The reversal of 120310023213102 is 201312320013021.
120310023213102 is digitally balanced in base 4, 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 (120310023213073) and next prime (120310023213131).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 348328852 + ... + 348674072.
It is an arithmetic number, because the mean of its divisors is an integer number (4012352361216).
Almost surely, 2120310023213102 is an apocalyptic number.
120310023213102 is an abundant number, since it is smaller than the sum of its proper divisors (136480527904722).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120310023213102 is a wasteful number, since it uses less digits than its factorization.
120310023213102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 372273.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 120310023213102 its reverse (201312320013021), we get a palindrome (321622343226123).
The spelling of 120310023213102 in words is "one hundred twenty trillion, three hundred ten billion, twenty-three million, two hundred thirteen thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •