Base | Representation |
---|---|
bin | 11011010010001111110101… |
… | …101011100100001001011001 |
3 | 120201220000002212110222021001 |
4 | 123102033311223210021121 |
5 | 111212044441024333423 |
6 | 1103115443554145001 |
7 | 34163541633431332 |
oct | 3322176553441131 |
9 | 521800085428231 |
10 | 120001213121113 |
11 | 35266257422045 |
12 | 11561057582161 |
13 | 51c60b186650c |
14 | 218c138217289 |
15 | dd1790dd3cad |
hex | 6d23f5ae4259 |
120001213121113 has 4 divisors (see below), whose sum is σ = 120314532215808. Its totient is φ = 119687894026420.
The previous prime is 120001213121107. The next prime is 120001213121129. The reversal of 120001213121113 is 311121312100021.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 120001213121113 - 29 = 120001213120601 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120001213122113) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 156659546773 + ... + 156659547538.
It is an arithmetic number, because the mean of its divisors is an integer number (30078633053952).
Almost surely, 2120001213121113 is an apocalyptic number.
It is an amenable number.
120001213121113 is a deficient number, since it is larger than the sum of its proper divisors (313319094695).
120001213121113 is an equidigital number, since it uses as much as digits as its factorization.
120001213121113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 313319094694.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 120001213121113 its reverse (311121312100021), we get a palindrome (431122525221134).
The spelling of 120001213121113 in words is "one hundred twenty trillion, one billion, two hundred thirteen million, one hundred twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •