Base | Representation |
---|---|
bin | 101110100100010010… |
… | …1101111001110101101 |
3 | 100120010022121001002201 |
4 | 1131020211233032231 |
5 | 3114301014201031 |
6 | 113535040021501 |
7 | 10140100553236 |
oct | 1351045571655 |
9 | 316108531081 |
10 | 100002100141 |
11 | 3945763aa59 |
12 | 1746a601891 |
13 | 9579096628 |
14 | 4ba944a08d |
15 | 2904501d61 |
hex | 174896f3ad |
100002100141 has 2 divisors, whose sum is σ = 100002100142. Its totient is φ = 100002100140.
The previous prime is 100002100129. The next prime is 100002100217. The reversal of 100002100141 is 141001200001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 100001412900 + 687241 = 316230^2 + 829^2 .
It is a cyclic number.
It is not a de Polignac number, because 100002100141 - 233 = 91412165549 is a prime.
It is a super-2 number, since 2×1000021001412 (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 (100002100741) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50001050070 + 50001050071.
It is an arithmetic number, because the mean of its divisors is an integer number (50001050071).
Almost surely, 2100002100141 is an apocalyptic number.
It is an amenable number.
100002100141 is a deficient number, since it is larger than the sum of its proper divisors (1).
100002100141 is an equidigital number, since it uses as much as digits as its factorization.
100002100141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 100002100141 its reverse (141001200001), we get a palindrome (241003300142).
The spelling of 100002100141 in words is "one hundred billion, two million, one hundred thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •