Base | Representation |
---|---|
bin | 10110101111010110101101… |
… | …010100000011000001101010 |
3 | 111010002222102221222121020211 |
4 | 112233112231110003001222 |
5 | 101102040440111413002 |
6 | 552412304252011334 |
7 | 30031400202603046 |
oct | 2657265524030152 |
9 | 433088387877224 |
10 | 100011221201002 |
11 | 29959580098611 |
12 | b272a17760b4a |
13 | 43a602cb3b857 |
14 | 1a9a7d7223026 |
15 | b867c49a4dd7 |
hex | 5af5ad50306a |
100011221201002 has 8 divisors (see below), whose sum is σ = 150114817979712. Its totient is φ = 49972948541100.
The previous prime is 100011221200909. The next prime is 100011221201039. The reversal of 100011221201002 is 200102122110001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1000112212010022 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16331025874 + ... + 16331031997.
It is an arithmetic number, because the mean of its divisors is an integer number (18764352247464).
Almost surely, 2100011221201002 is an apocalyptic number.
100011221201002 is a deficient number, since it is larger than the sum of its proper divisors (50103596778710).
100011221201002 is a wasteful number, since it uses less digits than its factorization.
100011221201002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32662059404.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 100011221201002 its reverse (200102122110001), we get a palindrome (300113343311003).
The spelling of 100011221201002 in words is "one hundred trillion, eleven billion, two hundred twenty-one million, two hundred one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •