Base | Representation |
---|---|
bin | 11011010100000111110010… |
… | …110000111010110111010001 |
3 | 120202100022120011120112011210 |
4 | 123110013302300322313101 |
5 | 111221202231340241423 |
6 | 1103254544411130333 |
7 | 34206051500226612 |
oct | 3324076260726721 |
9 | 522308504515153 |
10 | 120130013212113 |
11 | 35305941747843 |
12 | 115820024439a9 |
13 | 5205299c79108 |
14 | 21944761b7c09 |
15 | dd4ccd728b93 |
hex | 6d41f2c3add1 |
120130013212113 has 24 divisors (see below), whose sum is σ = 164036515088640. Its totient is φ = 78199592093280.
The previous prime is 120130013212103. The next prime is 120130013212147. The reversal of 120130013212113 is 311212310031021.
It is not a de Polignac number, because 120130013212113 - 214 = 120130013195729 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 120130013212113.
It is not an unprimeable number, because it can be changed into a prime (120130013212103) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 14240928 + ... + 21049086.
It is an arithmetic number, because the mean of its divisors is an integer number (6834854795360).
Almost surely, 2120130013212113 is an apocalyptic number.
It is an amenable number.
120130013212113 is a deficient number, since it is larger than the sum of its proper divisors (43906501876527).
120130013212113 is an equidigital number, since it uses as much as digits as its factorization.
120130013212113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6811429 (or 6811386 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 120130013212113 its reverse (311212310031021), we get a palindrome (431342323243134).
The spelling of 120130013212113 in words is "one hundred twenty trillion, one hundred thirty billion, thirteen million, two hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.167 sec. • engine limits •