Base | Representation |
---|---|
bin | 10111000000101001111100… |
… | …000101010111011110011011 |
3 | 111021022122011001110122022002 |
4 | 113000221330011113132123 |
5 | 101231030301402210021 |
6 | 555122403520351215 |
7 | 30213315564130226 |
oct | 2700517405273633 |
9 | 437278131418262 |
10 | 101200101210011 |
11 | 2a2777a3940901 |
12 | b42531117550b |
13 | 44611896a911b |
14 | 1adc17a9645bd |
15 | ba76a82ed50b |
hex | 5c0a7c15779b |
101200101210011 has 8 divisors (see below), whose sum is σ = 103143156268464. Its totient is φ = 99258291306720.
The previous prime is 101200101209981. The next prime is 101200101210029. The reversal of 101200101210011 is 110012101002101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101200101210011 - 246 = 30831357032347 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101200101209974 and 101200101210001.
It is not an unprimeable number, because it can be changed into a prime (101200101210811) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 311124680 + ... + 311449781.
It is an arithmetic number, because the mean of its divisors is an integer number (12892894533558).
Almost surely, 2101200101210011 is an apocalyptic number.
101200101210011 is a deficient number, since it is larger than the sum of its proper divisors (1943055058453).
101200101210011 is an equidigital number, since it uses as much as digits as its factorization.
101200101210011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 622577581.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 101200101210011 its reverse (110012101002101), we get a palindrome (211212202212112).
The spelling of 101200101210011 in words is "one hundred one trillion, two hundred billion, one hundred one million, two hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •