Base | Representation |
---|---|
bin | 11011010101010100010000… |
… | …110001010100001101000011 |
3 | 120202122011111101212212200121 |
4 | 123111110100301110031003 |
5 | 111224023410434323021 |
6 | 1103400404102201111 |
7 | 34215016265056531 |
oct | 3325242061241503 |
9 | 522564441785617 |
10 | 120212121011011 |
11 | 35337746429387 |
12 | 11595ab8123197 |
13 | 520cc5399c7c3 |
14 | 2198424c6d151 |
15 | dd6ed6ca0741 |
hex | 6d5510c54343 |
120212121011011 has 8 divisors (see below), whose sum is σ = 122031367719264. Its totient is φ = 118405208179200.
The previous prime is 120212121011009. The next prime is 120212121011117. The reversal of 120212121011011 is 110110121212021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 120212121011011 - 21 = 120212121011009 is a prime.
It is a super-3 number, since 3×1202121210110113 (a number of 43 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120212121021011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3083449471 + ... + 3083488456.
It is an arithmetic number, because the mean of its divisors is an integer number (15253920964908).
Almost surely, 2120212121011011 is an apocalyptic number.
120212121011011 is a deficient number, since it is larger than the sum of its proper divisors (1819246708253).
120212121011011 is a wasteful number, since it uses less digits than its factorization.
120212121011011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6166938221.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 120212121011011 its reverse (110110121212021), we get a palindrome (230322242223032).
The spelling of 120212121011011 in words is "one hundred twenty trillion, two hundred twelve billion, one hundred twenty-one million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •