Base | Representation |
---|---|
bin | 11011010010011010000110… |
… | …010110000010111111100011 |
3 | 120201221001112122220001112001 |
4 | 123102122012112002333203 |
5 | 111212240021402024303 |
6 | 1103124505110344431 |
7 | 34164411640336063 |
oct | 3322320626027743 |
9 | 521831478801461 |
10 | 120012230111203 |
11 | 3526a9a0204831 |
12 | 1156321105b117 |
13 | 51c714915c271 |
14 | 218c8a146b3a3 |
15 | dd1bd81cc31d |
hex | 6d2686582fe3 |
120012230111203 has 4 divisors (see below), whose sum is σ = 120023846831448. Its totient is φ = 120000613390960.
The previous prime is 120012230111177. The next prime is 120012230111239. The reversal of 120012230111203 is 302111032210021.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 120012230111203 - 229 = 120011693240291 is a prime.
It is a super-2 number, since 2×1200122301112032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120012230111803) 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, 5808344626 + ... + 5808365287.
It is an arithmetic number, because the mean of its divisors is an integer number (30005961707862).
Almost surely, 2120012230111203 is an apocalyptic number.
120012230111203 is a deficient number, since it is larger than the sum of its proper divisors (11616720245).
120012230111203 is a wasteful number, since it uses less digits than its factorization.
120012230111203 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11616720244.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 120012230111203 its reverse (302111032210021), we get a palindrome (422123262321224).
The spelling of 120012230111203 in words is "one hundred twenty trillion, twelve billion, two hundred thirty million, one hundred eleven thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •