Base | Representation |
---|---|
bin | 10110111111010110000010… |
… | …001110110000100001110001 |
3 | 111021000000121110000002202001 |
4 | 112333112002032300201301 |
5 | 101223041300031201001 |
6 | 555013144121454001 |
7 | 30203646206512351 |
oct | 2677260216604161 |
9 | 437000543002661 |
10 | 101110010022001 |
11 | 2a2425727a7922 |
12 | b40b969941301 |
13 | 445582ca0a256 |
14 | 1ad7a718cab61 |
15 | ba5183e5d001 |
hex | 5bf5823b0871 |
101110010022001 has 8 divisors (see below), whose sum is σ = 109547370640224. Its totient is φ = 92949284178240.
The previous prime is 101110010021989. The next prime is 101110010022181. The reversal of 101110010022001 is 100220010011101.
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 101110010022001 - 219 = 101110009497713 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101110010022401) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 69158692855 + ... + 69158694316.
It is an arithmetic number, because the mean of its divisors is an integer number (13693421330028).
Almost surely, 2101110010022001 is an apocalyptic number.
It is an amenable number.
101110010022001 is a deficient number, since it is larger than the sum of its proper divisors (8437360618223).
101110010022001 is a wasteful number, since it uses less digits than its factorization.
101110010022001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138317387231.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 101110010022001 its reverse (100220010011101), we get a palindrome (201330020033102).
The spelling of 101110010022001 in words is "one hundred one trillion, one hundred ten billion, ten million, twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •