Base | Representation |
---|---|
bin | 10110111101110000100111… |
… | …010010111111010010110001 |
3 | 111020121121112000211002001010 |
4 | 112331300213102333102301 |
5 | 101214300233204101001 |
6 | 554451134113101133 |
7 | 30163042444500153 |
oct | 2675604722772261 |
9 | 436547460732033 |
10 | 101001110222001 |
11 | 2a20036a699310 |
12 | b3b28375577a9 |
13 | 4448496431082 |
14 | 1ad26a0898ad3 |
15 | ba240d73a8d6 |
hex | 5bdc274bf4b1 |
101001110222001 has 16 divisors (see below), whose sum is σ = 146933889087168. Its totient is φ = 61203134361600.
The previous prime is 101001110221969. The next prime is 101001110222011. The reversal of 101001110222001 is 100222011100101.
It is not a de Polignac number, because 101001110222001 - 25 = 101001110221969 is a prime.
It is not an unprimeable number, because it can be changed into a prime (101001110222011) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 241280520 + ... + 241698761.
It is an arithmetic number, because the mean of its divisors is an integer number (9183368067948).
Almost surely, 2101001110222001 is an apocalyptic number.
101001110222001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
101001110222001 is a deficient number, since it is larger than the sum of its proper divisors (45932778865167).
101001110222001 is a wasteful number, since it uses less digits than its factorization.
101001110222001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 482985632.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 101001110222001 its reverse (100222011100101), we get a palindrome (201223121322102).
The spelling of 101001110222001 in words is "one hundred one trillion, one billion, one hundred ten million, two hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •