Base | Representation |
---|---|
bin | 10110111101111000111111… |
… | …001100011110001000111000 |
3 | 111020122110201121202001112202 |
4 | 112331320333030132020320 |
5 | 101214422141340213422 |
6 | 554455222210525332 |
7 | 30163511316632540 |
oct | 2675707714361070 |
9 | 436573647661482 |
10 | 101010101101112 |
11 | 2a20416381a915 |
12 | b3b4526596848 |
13 | 444929a039998 |
14 | 1ad2cb49b8320 |
15 | ba2787c14b92 |
hex | 5bde3f31e238 |
101010101101112 has 64 divisors (see below), whose sum is σ = 216652498252800. Its totient is φ = 43249605626880.
The previous prime is 101010101101043. The next prime is 101010101101121. The reversal of 101010101101112 is 211101101010101.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 101010101101093 and 101010101101102.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 263183912 + ... + 263567432.
It is an arithmetic number, because the mean of its divisors is an integer number (3385195285200).
Almost surely, 2101010101101112 is an apocalyptic number.
It is an amenable number.
101010101101112 is an abundant number, since it is smaller than the sum of its proper divisors (115642397151688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101010101101112 is a wasteful number, since it uses less digits than its factorization.
101010101101112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 387916 (or 387912 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 101010101101112 its reverse (211101101010101), we get a palindrome (312111202111213).
The spelling of 101010101101112 in words is "one hundred one trillion, ten billion, one hundred one million, one hundred one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •