Base | Representation |
---|---|
bin | 10111000000101010110010… |
… | …010000100000111111001011 |
3 | 111021022201111101201011000110 |
4 | 113000222302100200333023 |
5 | 101231034132041232334 |
6 | 555123034025205403 |
7 | 30213350241442566 |
oct | 2700526220407713 |
9 | 437281441634013 |
10 | 101201010102219 |
11 | 2a27811a996a95 |
12 | b425525630863 |
13 | 44612a2a97071 |
14 | 1adc2255574dd |
15 | ba770ced4ae9 |
hex | 5c0ab2420fcb |
101201010102219 has 8 divisors (see below), whose sum is σ = 134934949185232. Its totient is φ = 67467205543680.
The previous prime is 101201010102187. The next prime is 101201010102239. The reversal of 101201010102219 is 912201010102101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101201010102219 - 25 = 101201010102187 is a prime.
It is a super-2 number, since 2×1012010101022192 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101201010102195 and 101201010102204.
It is not an unprimeable number, because it can be changed into a prime (101201010102239) 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, 31862494 + ... + 34894419.
It is an arithmetic number, because the mean of its divisors is an integer number (16866868648154).
Almost surely, 2101201010102219 is an apocalyptic number.
101201010102219 is a deficient number, since it is larger than the sum of its proper divisors (33733939083013).
101201010102219 is an equidigital number, since it uses as much as digits as its factorization.
101201010102219 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67262237.
The product of its (nonzero) digits is 72, while the sum is 21.
The spelling of 101201010102219 in words is "one hundred one trillion, two hundred one billion, ten million, one hundred two thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •