Base | Representation |
---|---|
bin | 10110111101110001011100… |
… | …011101100111010111000001 |
3 | 111020121200211012020020211100 |
4 | 112331301130131213113001 |
5 | 101214304100030400001 |
6 | 554451402415205013 |
7 | 30163103525255130 |
oct | 2675613435472701 |
9 | 436550735206740 |
10 | 101002002200001 |
11 | 2a200788141611 |
12 | b3b2a46216769 |
13 | 44485a91792c6 |
14 | 1ad2747127917 |
15 | ba2461bd0586 |
hex | 5bdc5c7675c1 |
101002002200001 has 96 divisors (see below), whose sum is σ = 175816224380160. Its totient is φ = 54649265029632.
The previous prime is 101002002199979. The next prime is 101002002200017. The reversal of 101002002200001 is 100002200200101.
It is not a de Polignac number, because 101002002200001 - 27 = 101002002199873 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (101002002200041) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 216377806 + ... + 216844088.
It is an arithmetic number, because the mean of its divisors is an integer number (1831419003960).
Almost surely, 2101002002200001 is an apocalyptic number.
It is an amenable number.
101002002200001 is a deficient number, since it is larger than the sum of its proper divisors (74814222180159).
101002002200001 is a wasteful number, since it uses less digits than its factorization.
101002002200001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 468615 (or 468612 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 101002002200001 its reverse (100002200200101), we get a palindrome (201004202400102).
The spelling of 101002002200001 in words is "one hundred one trillion, two billion, two million, two hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •