Base | Representation |
---|---|
bin | 10111001100010011111011… |
… | …011001100010001000000011 |
3 | 111101011012200010010001221010 |
4 | 113030103323121202020003 |
5 | 101332141223341320003 |
6 | 1000534354200332003 |
7 | 30325223242046601 |
oct | 2714237331421003 |
9 | 441135603101833 |
10 | 102001101120003 |
11 | 2a556473467798 |
12 | b5345b6474003 |
13 | 44bb87c8609c7 |
14 | 1b28c45a12871 |
15 | bbd4392a5003 |
hex | 5cc4fb662203 |
102001101120003 has 8 divisors (see below), whose sum is σ = 136285396070400. Its totient is φ = 67858770124808.
The previous prime is 102001101119999. The next prime is 102001101120011. The reversal of 102001101120003 is 300021101100201.
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 102001101120003 - 22 = 102001101119999 is a prime.
It is a super-2 number, since 2×1020011011200032 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (102001101120103) 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, 35490987123 + ... + 35490989996.
It is an arithmetic number, because the mean of its divisors is an integer number (17035674508800).
Almost surely, 2102001101120003 is an apocalyptic number.
102001101120003 is a deficient number, since it is larger than the sum of its proper divisors (34284294950397).
102001101120003 is an equidigital number, since it uses as much as digits as its factorization.
102001101120003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 70981977601.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 102001101120003 its reverse (300021101100201), we get a palindrome (402022202220204).
The spelling of 102001101120003 in words is "one hundred two trillion, one billion, one hundred one million, one hundred twenty thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •