Base | Representation |
---|---|
bin | 11011010010110101001011… |
… | …101100110110001001100000 |
3 | 120202000211121100201102210012 |
4 | 123102311023230312021200 |
5 | 111213224101104100412 |
6 | 1103150114511024052 |
7 | 34166461410003623 |
oct | 3322651354661140 |
9 | 522024540642705 |
10 | 120041311003232 |
11 | 352812636553a3 |
12 | 1156898820b028 |
13 | 51c9b01c9a598 |
14 | 219005d7c3dba |
15 | dd283b2a2c22 |
hex | 6d2d4bb36260 |
120041311003232 has 48 divisors (see below), whose sum is σ = 241830704198160. Its totient is φ = 58624027348992.
The previous prime is 120041311003193. The next prime is 120041311003249. The reversal of 120041311003232 is 232300113140021.
It is a junction number, because it is equal to n+sod(n) for n = 120041311003198 and 120041311003207.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 107555768 + ... + 108666120.
It is an arithmetic number, because the mean of its divisors is an integer number (5038139670795).
Almost surely, 2120041311003232 is an apocalyptic number.
It is an amenable number.
120041311003232 is an abundant number, since it is smaller than the sum of its proper divisors (121789393194928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120041311003232 is a wasteful number, since it uses less digits than its factorization.
120041311003232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1188975 (or 1188967 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 120041311003232 its reverse (232300113140021), we get a palindrome (352341424143253).
The spelling of 120041311003232 in words is "one hundred twenty trillion, forty-one billion, three hundred eleven million, three thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •