Base | Representation |
---|---|
bin | 11011010111000011111010… |
… | …111001000000100000100101 |
3 | 120210001121221212211121210210 |
4 | 123113003322321000200211 |
5 | 111233004430312404104 |
6 | 1103531432540010033 |
7 | 34226462313216156 |
oct | 3327037271004045 |
9 | 523047855747723 |
10 | 120332013013029 |
11 | 3538357a329a74 |
12 | 115b5197830919 |
13 | 521b34c6a2b2c |
14 | 21a0159b0192d |
15 | dda1a2521989 |
hex | 6d70fae40825 |
120332013013029 has 16 divisors (see below), whose sum is σ = 168890129220800. Its totient is φ = 75997774077696.
The previous prime is 120332013013027. The next prime is 120332013013063. The reversal of 120332013013029 is 920310310233021.
It is not a de Polignac number, because 120332013013029 - 21 = 120332013013027 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 120332013012987 and 120332013013005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120332013013027) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16190134 + ... + 22422855.
It is an arithmetic number, because the mean of its divisors is an integer number (10555633076300).
Almost surely, 2120332013013029 is an apocalyptic number.
120332013013029 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
It is an amenable number.
120332013013029 is a deficient number, since it is larger than the sum of its proper divisors (48558116207771).
120332013013029 is a wasteful number, since it uses less digits than its factorization.
120332013013029 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38667684.
The product of its (nonzero) digits is 5832, while the sum is 30.
The spelling of 120332013013029 in words is "one hundred twenty trillion, three hundred thirty-two billion, thirteen million, thirteen thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •