Base | Representation |
---|---|
bin | 11011010110100111000011… |
… | …100100000011010000011111 |
3 | 120202221122221221000111102220 |
4 | 123112213003210003100133 |
5 | 111232002442110020221 |
6 | 1103505305312120423 |
7 | 34224314265033342 |
oct | 3326470344032037 |
9 | 522848857014386 |
10 | 120301020001311 |
11 | 353714156055a6 |
12 | 115ab188236113 |
13 | 5218450679646 |
14 | 219c859848459 |
15 | dd948b6470c6 |
hex | 6d69c390341f |
120301020001311 has 8 divisors (see below), whose sum is σ = 160402810767024. Its totient is φ = 80199954618240.
The previous prime is 120301020001307. The next prime is 120301020001313. The reversal of 120301020001311 is 113100020103021.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 120301020001311 - 22 = 120301020001307 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120301020001313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 180958570 + ... + 181622151.
It is an arithmetic number, because the mean of its divisors is an integer number (20050351345878).
Almost surely, 2120301020001311 is an apocalyptic number.
120301020001311 is a deficient number, since it is larger than the sum of its proper divisors (40101790765713).
120301020001311 is a wasteful number, since it uses less digits than its factorization.
120301020001311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 362691321.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 120301020001311 its reverse (113100020103021), we get a palindrome (233401040104332).
The spelling of 120301020001311 in words is "one hundred twenty trillion, three hundred one billion, twenty million, one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •