Base | Representation |
---|---|
bin | 10111001111100010110010… |
… | …110010001000111010101101 |
3 | 111101221110000001002211202011 |
4 | 113033202302302020322231 |
5 | 101344311124102223343 |
6 | 1001224411031201221 |
7 | 30350245500026413 |
oct | 2717426262107255 |
9 | 441843001084664 |
10 | 102223221132973 |
11 | 2a631696415046 |
12 | b56b665b16211 |
13 | 45067ba831945 |
14 | 1b358b77952b3 |
15 | bc40d966229d |
hex | 5cf8b2c88ead |
102223221132973 has 2 divisors, whose sum is σ = 102223221132974. Its totient is φ = 102223221132972.
The previous prime is 102223221132941. The next prime is 102223221133013. The reversal of 102223221132973 is 379231122322201.
It is an a-pointer prime, because the next prime (102223221133013) can be obtained adding 102223221132973 to its sum of digits (40).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 101071716154249 + 1151504978724 = 10053443^2 + 1073082^2 .
It is a cyclic number.
It is not a de Polignac number, because 102223221132973 - 25 = 102223221132941 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102223221112973) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51111610566486 + 51111610566487.
It is an arithmetic number, because the mean of its divisors is an integer number (51111610566487).
Almost surely, 2102223221132973 is an apocalyptic number.
It is an amenable number.
102223221132973 is a deficient number, since it is larger than the sum of its proper divisors (1).
102223221132973 is an equidigital number, since it uses as much as digits as its factorization.
102223221132973 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108864, while the sum is 40.
The spelling of 102223221132973 in words is "one hundred two trillion, two hundred twenty-three billion, two hundred twenty-one million, one hundred thirty-two thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •