Base | Representation |
---|---|
bin | 10110111111010110001000… |
… | …001100100001101000101010 |
3 | 111021000000212102022120221222 |
4 | 112333112020030201220222 |
5 | 101223042001141200020 |
6 | 555013202054502042 |
7 | 30203651533251104 |
oct | 2677261014415052 |
9 | 437000772276858 |
10 | 101110110100010 |
11 | 2a242614241a20 |
12 | b40b997364922 |
13 | 445584767a3cb |
14 | 1ad7a80cdc574 |
15 | ba518cb2ab25 |
hex | 5bf588321a2a |
101110110100010 has 256 divisors, whose sum is σ = 211806324057600. Its totient is φ = 34412378112000.
The previous prime is 101110110099991. The next prime is 101110110100073. The reversal of 101110110100010 is 10001011011101.
It is a super-2 number, since 2×1011101101000102 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 3222206501 + ... + 3222237879.
It is an arithmetic number, because the mean of its divisors is an integer number (827368453350).
Almost surely, 2101110110100010 is an apocalyptic number.
101110110100010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101110110100010 is an abundant number, since it is smaller than the sum of its proper divisors (110696213957590).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101110110100010 is a wasteful number, since it uses less digits than its factorization.
101110110100010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31737.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 101110110100010 its reverse (10001011011101), we get a palindrome (111111121111111).
It can be divided in two parts, 1011101 and 10100010, that added together give a palindrome (11111111).
The spelling of 101110110100010 in words is "one hundred one trillion, one hundred ten billion, one hundred ten million, one hundred thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •