Base | Representation |
---|---|
bin | 10110111101111000111111… |
… | …101110011111101000010000 |
3 | 111020122110202020112012010002 |
4 | 112331320333232133220100 |
5 | 101214422201131120422 |
6 | 554455223130025132 |
7 | 30163511455510466 |
oct | 2675707756375020 |
9 | 436573666465102 |
10 | 101010110020112 |
11 | 2a204168861897 |
12 | b3b45295781a8 |
13 | 444929bb404b7 |
14 | 1ad2cb5c5a836 |
15 | ba27888c7692 |
hex | 5bde3fb9fa10 |
101010110020112 has 20 divisors (see below), whose sum is σ = 195707262504960. Its totient is φ = 50505010018848.
The previous prime is 101010110020097. The next prime is 101010110020147. The reversal of 101010110020112 is 211020011010101.
It is a junction number, because it is equal to n+sod(n) for n = 101010110020093 and 101010110020102.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22753793 + ... + 26828255.
It is an arithmetic number, because the mean of its divisors is an integer number (9785363125248).
Almost surely, 2101010110020112 is an apocalyptic number.
It is an amenable number.
101010110020112 is a deficient number, since it is larger than the sum of its proper divisors (94697152484848).
101010110020112 is a wasteful number, since it uses less digits than its factorization.
101010110020112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5623910 (or 5623904 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 101010110020112 its reverse (211020011010101), we get a palindrome (312030121030213).
The spelling of 101010110020112 in words is "one hundred one trillion, ten billion, one hundred ten million, twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •