Base | Representation |
---|---|
bin | 10110111111001101101001… |
… | …001100101010111110111010 |
3 | 111020222011100112021011000221 |
4 | 112333031221030222332322 |
5 | 101222414322012010020 |
6 | 555005054104050254 |
7 | 30203210013516355 |
oct | 2677155114527672 |
9 | 436864315234027 |
10 | 101101000110010 |
11 | 2a23976995666a |
12 | b40a07446398a |
13 | 4454a25199494 |
14 | 1ad745905529c |
15 | ba4d07e746aa |
hex | 5bf36932afba |
101101000110010 has 32 divisors (see below), whose sum is σ = 197167695988032. Its totient is φ = 37176400584960.
The previous prime is 101101000110001. The next prime is 101101000110013. The reversal of 101101000110010 is 10011000101101.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 101101000109975 and 101101000110002.
It is not an unprimeable number, because it can be changed into a prime (101101000110013) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 6915245776 + ... + 6915260395.
It is an arithmetic number, because the mean of its divisors is an integer number (6161490499626).
Almost surely, 2101101000110010 is an apocalyptic number.
101101000110010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101101000110010 is a deficient number, since it is larger than the sum of its proper divisors (96066695878022).
101101000110010 is a wasteful number, since it uses less digits than its factorization.
101101000110010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13830506238.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 101101000110010 its reverse (10011000101101), we get a palindrome (111112000211111).
The spelling of 101101000110010 in words is "one hundred one trillion, one hundred one billion, one hundred ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •