Base | Representation |
---|---|
bin | 10110110000101011011101… |
… | …010001101110100111010011 |
3 | 111010102200022211200100210002 |
4 | 112300223131101232213103 |
5 | 101110033321333301231 |
6 | 552522154120400215 |
7 | 30041101222463114 |
oct | 2660533521564723 |
9 | 433380284610702 |
10 | 100102220212691 |
11 | 299941277179a4 |
12 | b28859301606b |
13 | 43b17a29131b8 |
14 | 1aa0d8aa9220b |
15 | b88d4d8ba0cb |
hex | 5b0add46e9d3 |
100102220212691 has 2 divisors, whose sum is σ = 100102220212692. Its totient is φ = 100102220212690.
The previous prime is 100102220212679. The next prime is 100102220212703. The reversal of 100102220212691 is 196212022201001.
It is a balanced prime because it is at equal distance from previous prime (100102220212679) and next prime (100102220212703).
It is a cyclic number.
It is not a de Polignac number, because 100102220212691 - 210 = 100102220211667 is a prime.
It is a super-2 number, since 2×1001022202126912 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (100102220112691) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50051110106345 + 50051110106346.
It is an arithmetic number, because the mean of its divisors is an integer number (50051110106346).
Almost surely, 2100102220212691 is an apocalyptic number.
100102220212691 is a deficient number, since it is larger than the sum of its proper divisors (1).
100102220212691 is an equidigital number, since it uses as much as digits as its factorization.
100102220212691 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 29.
Adding to 100102220212691 its reverse (196212022201001), we get a palindrome (296314242413692).
The spelling of 100102220212691 in words is "one hundred trillion, one hundred two billion, two hundred twenty million, two hundred twelve thousand, six hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •