Base | Representation |
---|---|
bin | 110111111100001001… |
… | …1101000100000010001 |
3 | 102111002001210222002012 |
4 | 1233320103220200101 |
5 | 3432011240410301 |
6 | 131104215032305 |
7 | 11451635156432 |
oct | 1577023504021 |
9 | 374061728065 |
10 | 120130013201 |
11 | 46a46295a50 |
12 | 1b34736b695 |
13 | b436108b63 |
14 | 5b5870b489 |
15 | 31d15d7ebb |
hex | 1bf84e8811 |
120130013201 has 8 divisors (see below), whose sum is σ = 131139429408. Its totient is φ = 109135348000.
The previous prime is 120130013183. The next prime is 120130013251. The reversal of 120130013201 is 102310031021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 120130013201 - 226 = 120062904337 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120130013251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3670715 + ... + 3703296.
It is an arithmetic number, because the mean of its divisors is an integer number (16392428676).
Almost surely, 2120130013201 is an apocalyptic number.
120130013201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
120130013201 is a deficient number, since it is larger than the sum of its proper divisors (11009416207).
120130013201 is a wasteful number, since it uses less digits than its factorization.
120130013201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7375503.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 120130013201 its reverse (102310031021), we get a palindrome (222440044222).
The spelling of 120130013201 in words is "one hundred twenty billion, one hundred thirty million, thirteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •