Base | Representation |
---|---|
bin | 101110110000000100… |
… | …1010101110110100111 |
3 | 100121010212020202012212 |
4 | 1131200021111312213 |
5 | 3121103202344401 |
6 | 114042154434035 |
7 | 10152640022543 |
oct | 1354011256647 |
9 | 317125222185 |
10 | 100397309351 |
11 | 3963a733539 |
12 | 1755aa3291b |
13 | 960cc1b431 |
14 | 4c05b24a23 |
15 | 292906adbb |
hex | 1760255da7 |
100397309351 has 2 divisors, whose sum is σ = 100397309352. Its totient is φ = 100397309350.
The previous prime is 100397309329. The next prime is 100397309429. The reversal of 100397309351 is 153903793001.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 100397309351 - 214 = 100397292967 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100397309299 and 100397309308.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100397300351) 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, 50198654675 + 50198654676.
It is an arithmetic number, because the mean of its divisors is an integer number (50198654676).
Almost surely, 2100397309351 is an apocalyptic number.
100397309351 is a deficient number, since it is larger than the sum of its proper divisors (1).
100397309351 is an equidigital number, since it uses as much as digits as its factorization.
100397309351 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 76545, while the sum is 41.
The spelling of 100397309351 in words is "one hundred billion, three hundred ninety-seven million, three hundred nine thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •