Base | Representation |
---|---|
bin | 10110110010010000000010… |
… | …000010101100101011100001 |
3 | 111010211000001220210112022012 |
4 | 112302100002002230223201 |
5 | 101113321003032241001 |
6 | 553043534022322305 |
7 | 30051643311023522 |
oct | 2662200202545341 |
9 | 433730056715265 |
10 | 100210211212001 |
11 | 29a25a03833060 |
12 | b2a54b0b89395 |
13 | 43bba22b33ca7 |
14 | 1aa62b3116849 |
15 | b8ba6e4232bb |
hex | 5b24020acae1 |
100210211212001 has 8 divisors (see below), whose sum is σ = 109320514063104. Its totient is φ = 91099955635920.
The previous prime is 100210211211961. The next prime is 100210211212021. The reversal of 100210211212001 is 100212112012001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100210211212001 - 238 = 99935333305057 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100210211212021) 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, 7311866 + ... + 15933731.
It is an arithmetic number, because the mean of its divisors is an integer number (13665064257888).
Almost surely, 2100210211212001 is an apocalyptic number.
100210211212001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
100210211212001 is a deficient number, since it is larger than the sum of its proper divisors (9110302851103).
100210211212001 is a wasteful number, since it uses less digits than its factorization.
100210211212001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23637511.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 100210211212001 its reverse (100212112012001), we get a palindrome (200422323224002).
The spelling of 100210211212001 in words is "one hundred trillion, two hundred ten billion, two hundred eleven million, two hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •