Base | Representation |
---|---|
bin | 101111001000010100… |
… | …1010111001111011011 |
3 | 100200020120101000200100 |
4 | 1132100221113033123 |
5 | 3124240004310021 |
6 | 114255023110443 |
7 | 10212050250636 |
oct | 1362051271733 |
9 | 320216330610 |
10 | 101211010011 |
11 | 39a17a81921 |
12 | 17747442423 |
13 | 970c68a407 |
14 | 4c81c18c1d |
15 | 29756ec626 |
hex | 1790a573db |
101211010011 has 12 divisors (see below), whose sum is σ = 150144862192. Its totient is φ = 65650384656.
The previous prime is 101211010009. The next prime is 101211010013. The reversal of 101211010011 is 110010112101.
It is an interprime number because it is at equal distance from previous prime (101211010009) and next prime (101211010013).
It is not a de Polignac number, because 101211010011 - 21 = 101211010009 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101211009975 and 101211010002.
It is not an unprimeable number, because it can be changed into a prime (101211010013) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 151968151 + ... + 151968816.
Almost surely, 2101211010011 is an apocalyptic number.
101211010011 is a deficient number, since it is larger than the sum of its proper divisors (48933852181).
101211010011 is a wasteful number, since it uses less digits than its factorization.
101211010011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 303937010 (or 303937007 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 101211010011 its reverse (110010112101), we get a palindrome (211221122112).
It can be divided in two parts, 1012110 and 10011, that added together give a square (1022121 = 10112).
The spelling of 101211010011 in words is "one hundred one billion, two hundred eleven million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •