Base | Representation |
---|---|
bin | 10110101111010110101101… |
… | …010111000110011000110001 |
3 | 111010002222110000111020220211 |
4 | 112233112231113012120301 |
5 | 101102040440313014301 |
6 | 552412304321104121 |
7 | 30031400212445020 |
oct | 2657265527063061 |
9 | 433088400436824 |
10 | 100011222001201 |
11 | 29959580594835 |
12 | b272a17a88041 |
13 | 43a603005bb44 |
14 | 1a9a7d73908b7 |
15 | b867c4ab2051 |
hex | 5af5ad5c6631 |
100011222001201 has 8 divisors (see below), whose sum is σ = 120314252031680. Its totient is φ = 81212120121168.
The previous prime is 100011222001151. The next prime is 100011222001253. The reversal of 100011222001201 is 102100222110001.
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 100011222001201 - 235 = 99976862262833 is a prime.
It is a super-3 number, since 3×1000112220012013 (a number of 43 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (100011222001001) 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, 375982037466 + ... + 375982037731.
It is an arithmetic number, because the mean of its divisors is an integer number (15039281503960).
Almost surely, 2100011222001201 is an apocalyptic number.
It is an amenable number.
100011222001201 is a deficient number, since it is larger than the sum of its proper divisors (20303030030479).
100011222001201 is an equidigital number, since it uses as much as digits as its factorization.
100011222001201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 751964075223.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 100011222001201 its reverse (102100222110001), we get a palindrome (202111444111202).
The spelling of 100011222001201 in words is "one hundred trillion, eleven billion, two hundred twenty-two million, one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •