Base | Representation |
---|---|
bin | 10110111101110000100110… |
… | …110000001100001111101010 |
3 | 111020121121111101122122000121 |
4 | 112331300212300030033222 |
5 | 101214300223340200020 |
6 | 554451133145353454 |
7 | 30163042304115346 |
oct | 2675604660141752 |
9 | 436547441578017 |
10 | 101001101100010 |
11 | 2a200365528881 |
12 | b3b283449888a |
13 | 4448494589047 |
14 | 1ad269d5a2626 |
15 | ba240ca37baa |
hex | 5bdc26c0c3ea |
101001101100010 has 32 divisors (see below), whose sum is σ = 183252023027712. Its totient is φ = 40078273435200.
The previous prime is 101001101099971. The next prime is 101001101100017. The reversal of 101001101100010 is 10001101100101.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 101001101099966 and 101001101100002.
It is not an unprimeable number, because it can be changed into a prime (101001101100017) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8558089 + ... + 16590451.
It is an arithmetic number, because the mean of its divisors is an integer number (5726625719616).
Almost surely, 2101001101100010 is an apocalyptic number.
101001101100010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101001101100010 is a deficient number, since it is larger than the sum of its proper divisors (82250921927702).
101001101100010 is a wasteful number, since it uses less digits than its factorization.
101001101100010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8042398.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 101001101100010 its reverse (10001101100101), we get a palindrome (111002202200111).
Subtracting from 101001101100010 its reverse (10001101100101), we obtain a palindrome (90999999999909).
The spelling of 101001101100010 in words is "one hundred one trillion, one billion, one hundred one million, one hundred thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •