Base | Representation |
---|---|
bin | 11011010011101110101000… |
… | …101110101010001111111011 |
3 | 120202020201211122220022112220 |
4 | 123103232220232222033323 |
5 | 111220231421313131021 |
6 | 1103234320200135123 |
7 | 34204104222620250 |
oct | 3323565056521773 |
9 | 522221748808486 |
10 | 120103001302011 |
11 | 352a54401799a2 |
12 | 115789241674a3 |
13 | 5202883988460 |
14 | 2193032955427 |
15 | dd424c0decc6 |
hex | 6d3ba8baa3fb |
120103001302011 has 128 divisors (see below), whose sum is σ = 208648667136000. Its totient is φ = 59744258380800.
The previous prime is 120103001302003. The next prime is 120103001302013. The reversal of 120103001302011 is 110203100301021.
It is a happy number.
It is not a de Polignac number, because 120103001302011 - 23 = 120103001302003 is a prime.
It is a super-2 number, since 2×1201030013020112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (120103001302013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 306189990 + ... + 306581988.
It is an arithmetic number, because the mean of its divisors is an integer number (1630067712000).
Almost surely, 2120103001302011 is an apocalyptic number.
120103001302011 is a deficient number, since it is larger than the sum of its proper divisors (88545665833989).
120103001302011 is a wasteful number, since it uses less digits than its factorization.
120103001302011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 392977.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 120103001302011 its reverse (110203100301021), we get a palindrome (230306101603032).
The spelling of 120103001302011 in words is "one hundred twenty trillion, one hundred three billion, one million, three hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •