Base | Representation |
---|---|
bin | 10111000000111110100001… |
… | …110111110010001100000011 |
3 | 111021101202012212002120011011 |
4 | 113000332201313302030003 |
5 | 101231411041231120344 |
6 | 555140501421101351 |
7 | 30215030503663420 |
oct | 2700764167621403 |
9 | 437352185076134 |
10 | 101222210020099 |
11 | 2a286109776083 |
12 | b4296613b7857 |
13 | 44632a0c3797c |
14 | 1add276d4ad47 |
15 | ba804e271d34 |
hex | 5c0fa1df2303 |
101222210020099 has 8 divisors (see below), whose sum is σ = 115781315264768. Its totient is φ = 86687802157320.
The previous prime is 101222210020069. The next prime is 101222210020147. The reversal of 101222210020099 is 990020012222101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101222210020099 - 25 = 101222210020067 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 101222210020099.
It is not an unprimeable number, because it can be changed into a prime (101222210020069) 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, 6174336687 + ... + 6174353080.
It is an arithmetic number, because the mean of its divisors is an integer number (14472664408096).
Almost surely, 2101222210020099 is an apocalyptic number.
101222210020099 is a deficient number, since it is larger than the sum of its proper divisors (14559105244669).
101222210020099 is a wasteful number, since it uses less digits than its factorization.
101222210020099 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12348690945.
The product of its (nonzero) digits is 2592, while the sum is 31.
The spelling of 101222210020099 in words is "one hundred one trillion, two hundred twenty-two billion, two hundred ten million, twenty thousand, ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •