Base | Representation |
---|---|
bin | 10110111101101111100101… |
… | …110110011100011001110101 |
3 | 111020121111200111201210111010 |
4 | 112331233211312130121311 |
5 | 101214241011112020041 |
6 | 554450433131102433 |
7 | 30163003312565205 |
oct | 2675574566343165 |
9 | 436544614653433 |
10 | 101000012220021 |
11 | 2a1aa956919162 |
12 | b3b258b8a1a19 |
13 | 444834cacc965 |
14 | 1ad25d8b1a405 |
15 | ba239714ba16 |
hex | 5bdbe5d9c675 |
101000012220021 has 8 divisors (see below), whose sum is σ = 142588252545984. Its totient is φ = 63372556687040.
The previous prime is 101000012220007. The next prime is 101000012220049. The reversal of 101000012220021 is 120022210000101.
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 101000012220021 - 27 = 101000012219893 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101000012219979 and 101000012220006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101000012220071) 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, 990196198185 + ... + 990196198286.
It is an arithmetic number, because the mean of its divisors is an integer number (17823531568248).
Almost surely, 2101000012220021 is an apocalyptic number.
It is an amenable number.
101000012220021 is a deficient number, since it is larger than the sum of its proper divisors (41588240325963).
101000012220021 is a wasteful number, since it uses less digits than its factorization.
101000012220021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1980392396491.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 101000012220021 its reverse (120022210000101), we get a palindrome (221022222220122).
The spelling of 101000012220021 in words is "one hundred one trillion, twelve million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •