Base | Representation |
---|---|
bin | 11011010111000010111111… |
… | …101101000000111010010001 |
3 | 120210001112101200100000010101 |
4 | 123113002333231000322101 |
5 | 111233000412110410301 |
6 | 1103531150224332401 |
7 | 34226425564652014 |
oct | 3327027755007221 |
9 | 523045350300111 |
10 | 120331020013201 |
11 | 3538310a857558 |
12 | 115b4b5b174101 |
13 | 521b221a46c7a |
14 | 21a00a3c9737b |
15 | dda145274701 |
hex | 6d70bfb40e91 |
120331020013201 has 4 divisors (see below), whose sum is σ = 120362299200832. Its totient is φ = 120299740825572.
The previous prime is 120331020013163. The next prime is 120331020013229. The reversal of 120331020013201 is 102310020133021.
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 120331020013201 - 27 = 120331020013073 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120331020713201) 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, 15639588045 + ... + 15639595738.
It is an arithmetic number, because the mean of its divisors is an integer number (30090574800208).
Almost surely, 2120331020013201 is an apocalyptic number.
It is an amenable number.
120331020013201 is a deficient number, since it is larger than the sum of its proper divisors (31279187631).
120331020013201 is an equidigital number, since it uses as much as digits as its factorization.
120331020013201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31279187630.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 120331020013201 its reverse (102310020133021), we get a palindrome (222641040146222).
The spelling of 120331020013201 in words is "one hundred twenty trillion, three hundred thirty-one billion, twenty million, thirteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •