Base | Representation |
---|---|
bin | 101110100111111101… |
… | …1110111001010100001 |
3 | 100120102220111021211211 |
4 | 1131033323313022201 |
5 | 3120024041342241 |
6 | 113555201310121 |
7 | 10143125231116 |
oct | 1351773671241 |
9 | 316386437754 |
10 | 100125340321 |
11 | 39510165146 |
12 | 174a3935341 |
13 | 9598786306 |
14 | 4bbb96a90d |
15 | 2910247781 |
hex | 174fef72a1 |
100125340321 has 2 divisors, whose sum is σ = 100125340322. Its totient is φ = 100125340320.
The previous prime is 100125340277. The next prime is 100125340327. The reversal of 100125340321 is 123043521001.
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., 51116235921 + 49009104400 = 226089^2 + 221380^2 .
It is a cyclic number.
It is not a de Polignac number, because 100125340321 - 211 = 100125338273 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100125340292 and 100125340301.
It is not a weakly prime, because it can be changed into another prime (100125340327) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50062670160 + 50062670161.
It is an arithmetic number, because the mean of its divisors is an integer number (50062670161).
Almost surely, 2100125340321 is an apocalyptic number.
It is an amenable number.
100125340321 is a deficient number, since it is larger than the sum of its proper divisors (1).
100125340321 is an equidigital number, since it uses as much as digits as its factorization.
100125340321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 720, while the sum is 22.
Adding to 100125340321 its reverse (123043521001), we get a palindrome (223168861322).
The spelling of 100125340321 in words is "one hundred billion, one hundred twenty-five million, three hundred forty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •