Base | Representation |
---|---|
bin | 100010000111000001010101… |
… | …0111011011011000011001111 |
3 | 1110100022210022010122201212112 |
4 | 1010032002222323123003033 |
5 | 303311211221400232031 |
6 | 2542040502333454235 |
7 | 120124414132553126 |
oct | 10416025273330317 |
9 | 1410283263581775 |
10 | 300032103133391 |
11 | 8766599a441822 |
12 | 2979829434137b |
13 | cb54ba1414035 |
14 | 54138ba304abd |
15 | 24a47cbe1d62b |
hex | 110e0aaedb0cf |
300032103133391 has 2 divisors, whose sum is σ = 300032103133392. Its totient is φ = 300032103133390.
The previous prime is 300032103133319. The next prime is 300032103133393. The reversal of 300032103133391 is 193331301230003.
Together with previous prime (300032103133319) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 300032103133391 - 238 = 299757225226447 is a prime.
Together with 300032103133393, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (300032103133393) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 150016051566695 + 150016051566696.
It is an arithmetic number, because the mean of its divisors is an integer number (150016051566696).
Almost surely, 2300032103133391 is an apocalyptic number.
300032103133391 is a deficient number, since it is larger than the sum of its proper divisors (1).
300032103133391 is an equidigital number, since it uses as much as digits as its factorization.
300032103133391 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 13122, while the sum is 32.
Adding to 300032103133391 its reverse (193331301230003), we get a palindrome (493363404363394).
The spelling of 300032103133391 in words is "three hundred trillion, thirty-two billion, one hundred three million, one hundred thirty-three thousand, three hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •