Base | Representation |
---|---|
bin | 10111001100011110000110… |
… | …010110001001101010111011 |
3 | 111101012020212020001110200012 |
4 | 113030132012112021222323 |
5 | 101332331110140413034 |
6 | 1000543402005132135 |
7 | 30326061002521130 |
oct | 2714360626115273 |
9 | 441166766043605 |
10 | 102012022201019 |
11 | 2a5600680a2587 |
12 | b5367439ba04b |
13 | 44bc900316018 |
14 | 1b295a021c587 |
15 | bbd877e55cce |
hex | 5cc786589abb |
102012022201019 has 8 divisors (see below), whose sum is σ = 118561188030720. Its totient is φ = 85956861321576.
The previous prime is 102012022200917. The next prime is 102012022201027. The reversal of 102012022201019 is 910102220210201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102012022201019 - 244 = 84419836156603 is a prime.
It is a super-2 number, since 2×1020120222010192 (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 = 102012022200985 and 102012022201003.
It is not an unprimeable number, because it can be changed into a prime (102012022201079) 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, 123501237119 + ... + 123501237944.
It is an arithmetic number, because the mean of its divisors is an integer number (14820148503840).
Almost surely, 2102012022201019 is an apocalyptic number.
102012022201019 is a deficient number, since it is larger than the sum of its proper divisors (16549165829701).
102012022201019 is an equidigital number, since it uses as much as digits as its factorization.
102012022201019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 247002475129.
The product of its (nonzero) digits is 288, while the sum is 23.
The spelling of 102012022201019 in words is "one hundred two trillion, twelve billion, twenty-two million, two hundred one thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •