Base | Representation |
---|---|
bin | 10111001100100111100100… |
… | …111111011100110011111011 |
3 | 111101020020010112102020212212 |
4 | 113030213210333130303323 |
5 | 101333012431201121334 |
6 | 1000552203543125335 |
7 | 30326601136536323 |
oct | 2714474477346373 |
9 | 441206115366785 |
10 | 102022200020219 |
11 | 2a56441021a806 |
12 | b53870444384b |
13 | 44c0862ac284b |
14 | 1b29c87c2c283 |
15 | bbdc7173aece |
hex | 5cc9e4fdccfb |
102022200020219 has 8 divisors (see below), whose sum is σ = 102430269726720. Its totient is φ = 101614643289000.
The previous prime is 102022200020203. The next prime is 102022200020243. The reversal of 102022200020219 is 912020002220201.
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 102022200020219 - 24 = 102022200020203 is a prime.
It is a super-2 number, since 2×1020222000202192 (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 = 102022200020194 and 102022200020203.
It is not an unprimeable number, because it can be changed into a prime (102022200020249) 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, 127845257 + ... + 128640794.
It is an arithmetic number, because the mean of its divisors is an integer number (12803783715840).
Almost surely, 2102022200020219 is an apocalyptic number.
102022200020219 is a deficient number, since it is larger than the sum of its proper divisors (408069706501).
102022200020219 is a wasteful number, since it uses less digits than its factorization.
102022200020219 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 256487641.
The product of its (nonzero) digits is 576, while the sum is 23.
The spelling of 102022200020219 in words is "one hundred two trillion, twenty-two billion, two hundred million, twenty thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •