Base | Representation |
---|---|
bin | 10110110010000110101110… |
… | …100001101011000010011001 |
3 | 111010210001021121210000022102 |
4 | 112302012232201223002121 |
5 | 101113140022322023001 |
6 | 553035202354333145 |
7 | 30051140602044263 |
oct | 2662065641530231 |
9 | 433701247700272 |
10 | 100200220111001 |
11 | 29a21747046a9a |
12 | b2a3582b8a1b5 |
13 | 43baabcc411ca |
14 | 1aa5a0622cb33 |
15 | b8b687221e6b |
hex | 5b21ae86b099 |
100200220111001 has 8 divisors (see below), whose sum is σ = 104399144020224. Its totient is φ = 96061712373360.
The previous prime is 100200220110973. The next prime is 100200220111003. The reversal of 100200220111001 is 100111022002001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100200220111001 is a prime.
It is a super-2 number, since 2×1002002201110012 (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 (100200220111003) 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, 15104039510 + ... + 15104046143.
It is an arithmetic number, because the mean of its divisors is an integer number (13049893002528).
Almost surely, 2100200220111001 is an apocalyptic number.
It is an amenable number.
100200220111001 is a deficient number, since it is larger than the sum of its proper divisors (4198923909223).
100200220111001 is a wasteful number, since it uses less digits than its factorization.
100200220111001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30208085791.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 100200220111001 its reverse (100111022002001), we get a palindrome (200311242113002).
The spelling of 100200220111001 in words is "one hundred trillion, two hundred billion, two hundred twenty million, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •