Base | Representation |
---|---|
bin | 101110101010001100… |
… | …1001010111101010001 |
3 | 100120122010020010100001 |
4 | 1131110121022331101 |
5 | 3120202213214213 |
6 | 114010432330001 |
7 | 10145024033662 |
oct | 1352431127521 |
9 | 316563203301 |
10 | 100200132433 |
11 | 395493a9605 |
12 | 175049a3901 |
13 | 95ab1120bb |
14 | 4bc7879369 |
15 | 2916abd1dd |
hex | 175464af51 |
100200132433 has 2 divisors, whose sum is σ = 100200132434. Its totient is φ = 100200132432.
The previous prime is 100200132427. The next prime is 100200132437. The reversal of 100200132433 is 334231002001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 98732323089 + 1467809344 = 314217^2 + 38312^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100200132433 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 100200132433.
It is not a weakly prime, because it can be changed into another prime (100200132437) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50100066216 + 50100066217.
It is an arithmetic number, because the mean of its divisors is an integer number (50100066217).
Almost surely, 2100200132433 is an apocalyptic number.
It is an amenable number.
100200132433 is a deficient number, since it is larger than the sum of its proper divisors (1).
100200132433 is an equidigital number, since it uses as much as digits as its factorization.
100200132433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 100200132433 its reverse (334231002001), we get a palindrome (434431134434).
The spelling of 100200132433 in words is "one hundred billion, two hundred million, one hundred thirty-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •