Base | Representation |
---|---|
bin | 10110101111101100001110… |
… | …010000001110000111101101 |
3 | 111010012012001221000100002202 |
4 | 112233230032100032013231 |
5 | 101102430243020034201 |
6 | 552431044443231245 |
7 | 30033145523011226 |
oct | 2657541620160755 |
9 | 433165057010082 |
10 | 100034322424301 |
11 | 299683551345a1 |
12 | b2773a4218525 |
13 | 43a8271b7c255 |
14 | 1a9b98934024d |
15 | b871c7b0bc6b |
hex | 5afb0e40e1ed |
100034322424301 has 2 divisors, whose sum is σ = 100034322424302. Its totient is φ = 100034322424300.
The previous prime is 100034322424247. The next prime is 100034322424313. The reversal of 100034322424301 is 103424223430001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 95400657190276 + 4633665234025 = 9767326^2 + 2152595^2 .
It is a cyclic number.
It is not a de Polignac number, because 100034322424301 - 226 = 100034255315437 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100034324424301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50017161212150 + 50017161212151.
It is an arithmetic number, because the mean of its divisors is an integer number (50017161212151).
Almost surely, 2100034322424301 is an apocalyptic number.
It is an amenable number.
100034322424301 is a deficient number, since it is larger than the sum of its proper divisors (1).
100034322424301 is an equidigital number, since it uses as much as digits as its factorization.
100034322424301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13824, while the sum is 29.
Adding to 100034322424301 its reverse (103424223430001), we get a palindrome (203458545854302).
The spelling of 100034322424301 in words is "one hundred trillion, thirty-four billion, three hundred twenty-two million, four hundred twenty-four thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •