Base | Representation |
---|---|
bin | 10111001111100010111000… |
… | …000101111001110011001001 |
3 | 111101221110020020200220202021 |
4 | 113033202320011321303021 |
5 | 101344311314402400014 |
6 | 1001224423532204441 |
7 | 30350250631055155 |
oct | 2717427005716311 |
9 | 441843206626667 |
10 | 102223310200009 |
11 | 2a631731719469 |
12 | b56b68b909721 |
13 | 450680311802b |
14 | 1b358c553c065 |
15 | bc40e23a7624 |
hex | 5cf8b8179cc9 |
102223310200009 has 4 divisors (see below), whose sum is σ = 102225434104080. Its totient is φ = 102221186295940.
The previous prime is 102223310199947. The next prime is 102223310200019. The reversal of 102223310200009 is 900002013322201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 102223310200009 - 211 = 102223310197961 is a prime.
It is a super-5 number, since 5×1022233102000095 (a number of 71 digits) contains 55555 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102223310200019) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1061879839 + ... + 1061976100.
It is an arithmetic number, because the mean of its divisors is an integer number (25556358526020).
Almost surely, 2102223310200009 is an apocalyptic number.
It is an amenable number.
102223310200009 is a deficient number, since it is larger than the sum of its proper divisors (2123904071).
102223310200009 is an equidigital number, since it uses as much as digits as its factorization.
102223310200009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2123904070.
The product of its (nonzero) digits is 1296, while the sum is 25.
The spelling of 102223310200009 in words is "one hundred two trillion, two hundred twenty-three billion, three hundred ten million, two hundred thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •