Base | Representation |
---|---|
bin | 100010000110111100101011… |
… | …0110000110001110100000111 |
3 | 1110100021211111002002221001201 |
4 | 1010031321112300301310013 |
5 | 303311030230341403221 |
6 | 2542032130040003331 |
7 | 120123611232064021 |
oct | 10415712660616407 |
9 | 1410254432087051 |
10 | 300022101122311 |
11 | 87661727583867 |
12 | 29796362760547 |
13 | cb53c691a1399 |
14 | 541320bbbb011 |
15 | 24a43e3cb4891 |
hex | 110de56c31d07 |
300022101122311 has 2 divisors, whose sum is σ = 300022101122312. Its totient is φ = 300022101122310.
The previous prime is 300022101122291. The next prime is 300022101122327. The reversal of 300022101122311 is 113221101220003.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 300022101122311 - 241 = 297823077866759 is a prime.
It is a super-2 number, since 2×3000221011223112 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (300022101122011) 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, 150011050561155 + 150011050561156.
It is an arithmetic number, because the mean of its divisors is an integer number (150011050561156).
Almost surely, 2300022101122311 is an apocalyptic number.
300022101122311 is a deficient number, since it is larger than the sum of its proper divisors (1).
300022101122311 is an equidigital number, since it uses as much as digits as its factorization.
300022101122311 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 300022101122311 its reverse (113221101220003), we get a palindrome (413243202342314).
The spelling of 300022101122311 in words is "three hundred trillion, twenty-two billion, one hundred one million, one hundred twenty-two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •