Base | Representation |
---|---|
bin | 101110110001011000… |
… | …1101001100011010111 |
3 | 100121020221021022200112 |
4 | 1131202301221203113 |
5 | 3121201001231411 |
6 | 114050412233235 |
7 | 10154014033052 |
oct | 1354261514327 |
9 | 317227238615 |
10 | 100441430231 |
11 | 3966262917a |
12 | 1757176b81b |
13 | 96190c886c |
14 | 4c0b92ba99 |
15 | 292cd83b8b |
hex | 1762c698d7 |
100441430231 has 2 divisors, whose sum is σ = 100441430232. Its totient is φ = 100441430230.
The previous prime is 100441430227. The next prime is 100441430233. The reversal of 100441430231 is 132034144001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 100441430231 - 22 = 100441430227 is a prime.
It is a super-3 number, since 3×1004414302313 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
Together with 100441430233, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 100441430197 and 100441430206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100441430233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50220715115 + 50220715116.
It is an arithmetic number, because the mean of its divisors is an integer number (50220715116).
Almost surely, 2100441430231 is an apocalyptic number.
100441430231 is a deficient number, since it is larger than the sum of its proper divisors (1).
100441430231 is an equidigital number, since it uses as much as digits as its factorization.
100441430231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 100441430231 its reverse (132034144001), we get a palindrome (232475574232).
The spelling of 100441430231 in words is "one hundred billion, four hundred forty-one million, four hundred thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •