Base | Representation |
---|---|
bin | 101110101000001011… |
… | …0001001011100011001 |
3 | 100120110101110100222211 |
4 | 1131100112021130121 |
5 | 3120032322342222 |
6 | 114000005115121 |
7 | 10143240630304 |
oct | 1352026113431 |
9 | 316411410884 |
10 | 100132230937 |
11 | 39514041172 |
12 | 174a60b8aa1 |
13 | 959a0297bb |
14 | 4bbc841b3b |
15 | 2910b59277 |
hex | 1750589719 |
100132230937 has 2 divisors, whose sum is σ = 100132230938. Its totient is φ = 100132230936.
The previous prime is 100132230889. The next prime is 100132230949. The reversal of 100132230937 is 739032231001.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 67050441481 + 33081789456 = 258941^2 + 181884^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100132230937 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100132230899 and 100132230908.
It is not a weakly prime, because it can be changed into another prime (100132230967) 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, 50066115468 + 50066115469.
It is an arithmetic number, because the mean of its divisors is an integer number (50066115469).
Almost surely, 2100132230937 is an apocalyptic number.
It is an amenable number.
100132230937 is a deficient number, since it is larger than the sum of its proper divisors (1).
100132230937 is an equidigital number, since it uses as much as digits as its factorization.
100132230937 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6804, while the sum is 31.
Adding to 100132230937 its reverse (739032231001), we get a palindrome (839164461938).
The spelling of 100132230937 in words is "one hundred billion, one hundred thirty-two million, two hundred thirty thousand, nine hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •