Base | Representation |
---|---|
bin | 101110100100110101… |
… | …0001000101101000101 |
3 | 100120011120022222121211 |
4 | 1131021222020231011 |
5 | 3114320111432102 |
6 | 113540520211421 |
7 | 10140406141546 |
oct | 1351152105505 |
9 | 316146288554 |
10 | 100020030277 |
11 | 39466777152 |
12 | 17474609b71 |
13 | 957ca0388b |
14 | 4bab9964cd |
15 | 2905d947d7 |
hex | 1749a88b45 |
100020030277 has 2 divisors, whose sum is σ = 100020030278. Its totient is φ = 100020030276.
The previous prime is 100020030221. The next prime is 100020030289. The reversal of 100020030277 is 772030020001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 82383924676 + 17636105601 = 287026^2 + 132801^2 .
It is a cyclic number.
It is not a de Polignac number, because 100020030277 - 215 = 100019997509 is a prime.
It is a super-2 number, since 2×1000200302772 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100020034277) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50010015138 + 50010015139.
It is an arithmetic number, because the mean of its divisors is an integer number (50010015139).
Almost surely, 2100020030277 is an apocalyptic number.
It is an amenable number.
100020030277 is a deficient number, since it is larger than the sum of its proper divisors (1).
100020030277 is an equidigital number, since it uses as much as digits as its factorization.
100020030277 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 588, while the sum is 22.
Adding to 100020030277 its reverse (772030020001), we get a palindrome (872050050278).
The spelling of 100020030277 in words is "one hundred billion, twenty million, thirty thousand, two hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •