Base | Representation |
---|---|
bin | 10110111101111010110111… |
… | …100001111111110111100011 |
3 | 111020122122221022200021011211 |
4 | 112331322313201333313203 |
5 | 101214440310210311321 |
6 | 554500154411050551 |
7 | 30163612333241104 |
oct | 2675726741776743 |
9 | 436578838607154 |
10 | 101012120010211 |
11 | 2a204aaa402133 |
12 | b3b49aa740a57 |
13 | 444952c3a4a57 |
14 | 1ad3026b963ab |
15 | ba28550b00e1 |
hex | 5bdeb787fde3 |
101012120010211 has 8 divisors (see below), whose sum is σ = 102310022289600. Its totient is φ = 99714699427200.
The previous prime is 101012120010203. The next prime is 101012120010247. The reversal of 101012120010211 is 112010021210101.
It is a happy number.
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 101012120010211 - 23 = 101012120010203 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101012120010191 and 101012120010200.
It is not an unprimeable number, because it can be changed into a prime (101012120410211) 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, 120001990 + ... + 120840811.
It is an arithmetic number, because the mean of its divisors is an integer number (12788752786200).
Almost surely, 2101012120010211 is an apocalyptic number.
101012120010211 is a deficient number, since it is larger than the sum of its proper divisors (1297902279389).
101012120010211 is an equidigital number, since it uses as much as digits as its factorization.
101012120010211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 240848189.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 101012120010211 its reverse (112010021210101), we get a palindrome (213022141220312).
The spelling of 101012120010211 in words is "one hundred one trillion, twelve billion, one hundred twenty million, ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •