Base | Representation |
---|---|
bin | 10111000000110100010010… |
… | …111000011101101111010011 |
3 | 111021100200212000112200212101 |
4 | 113000310102320131233103 |
5 | 101231221040101401003 |
6 | 555131443150541231 |
7 | 30214161260616556 |
oct | 2700642270355723 |
9 | 437320760480771 |
10 | 101211221122003 |
11 | 2a28148a830313 |
12 | b4274b5207817 |
13 | 446223c3c95c5 |
14 | 1adc91372a69d |
15 | ba7b0967711d |
hex | 5c0d12e1dbd3 |
101211221122003 has 8 divisors (see below), whose sum is σ = 101327649310368. Its totient is φ = 101094795263424.
The previous prime is 101211221121971. The next prime is 101211221122057. The reversal of 101211221122003 is 300221122112101.
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 101211221122003 - 25 = 101211221121971 is a prime.
It is a super-2 number, since 2×1012112211220032 (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 (101211221122073) 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, 95445450 + ... + 96500032.
It is an arithmetic number, because the mean of its divisors is an integer number (12665956163796).
Almost surely, 2101211221122003 is an apocalyptic number.
101211221122003 is a deficient number, since it is larger than the sum of its proper divisors (116428188365).
101211221122003 is a wasteful number, since it uses less digits than its factorization.
101211221122003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1164893.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 101211221122003 its reverse (300221122112101), we get a palindrome (401432343234104).
The spelling of 101211221122003 in words is "one hundred one trillion, two hundred eleven billion, two hundred twenty-one million, one hundred twenty-two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •