Base | Representation |
---|---|
bin | 10110101111011111001011… |
… | …000111101110001111100111 |
3 | 111010010211220110110110210102 |
4 | 112233133023013232033213 |
5 | 101102213044133034343 |
6 | 552420410250414315 |
7 | 30032141360522531 |
oct | 2657371307561747 |
9 | 433124813413712 |
10 | 100020311221223 |
11 | 29962415184318 |
12 | b274733a3139b |
13 | 43a6b4b14a043 |
14 | 1a9b01a58c851 |
15 | b86b57a143b8 |
hex | 5af7cb1ee3e7 |
100020311221223 has 2 divisors, whose sum is σ = 100020311221224. Its totient is φ = 100020311221222.
The previous prime is 100020311221177. The next prime is 100020311221231. The reversal of 100020311221223 is 322122113020001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 100020311221223 - 246 = 29651567043559 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100020311221195 and 100020311221204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100020311221423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50010155610611 + 50010155610612.
It is an arithmetic number, because the mean of its divisors is an integer number (50010155610612).
Almost surely, 2100020311221223 is an apocalyptic number.
100020311221223 is a deficient number, since it is larger than the sum of its proper divisors (1).
100020311221223 is an equidigital number, since it uses as much as digits as its factorization.
100020311221223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 100020311221223 its reverse (322122113020001), we get a palindrome (422142424241224).
The spelling of 100020311221223 in words is "one hundred trillion, twenty billion, three hundred eleven million, two hundred twenty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •