Base | Representation |
---|---|
bin | 10110111101111001110100… |
… | …110001111010101110111010 |
3 | 111020122120001021101102220121 |
4 | 112331321310301322232322 |
5 | 101214431012012010020 |
6 | 554455451323443454 |
7 | 30163542514242664 |
oct | 2675716461725672 |
9 | 436576037342817 |
10 | 101011000110010 |
11 | 2a204585235581 |
12 | b3b473768658a |
13 | 44493b1377203 |
14 | 1ad2d5c157534 |
15 | ba27dbae7baa |
hex | 5bde74c7abba |
101011000110010 has 8 divisors (see below), whose sum is σ = 181819800198036. Its totient is φ = 40404400044000.
The previous prime is 101011000109969. The next prime is 101011000110043. The reversal of 101011000110010 is 10011000110101.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 85361356852641 + 15649643257369 = 9239121^2 + 3955963^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 101011000109975 and 101011000110002.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5050550005491 + ... + 5050550005510.
Almost surely, 2101011000110010 is an apocalyptic number.
101011000110010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101011000110010 is a deficient number, since it is larger than the sum of its proper divisors (80808800088026).
101011000110010 is a wasteful number, since it uses less digits than its factorization.
101011000110010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10101100011008.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 101011000110010 its reverse (10011000110101), we get a palindrome (111022000220111).
Subtracting from 101011000110010 its reverse (10011000110101), we obtain a palindrome (90999999999909).
The spelling of 101011000110010 in words is "one hundred one trillion, eleven billion, one hundred ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •