Base | Representation |
---|---|
bin | 100010000111100110000100… |
… | …1100011000101100111101001 |
3 | 1110100121022221121000212201022 |
4 | 1010033030021203011213221 |
5 | 303314004312000013001 |
6 | 2542141031243302225 |
7 | 120133206231064250 |
oct | 10417141143054751 |
9 | 1410538847025638 |
10 | 300111000001001 |
11 | 876963a6694142 |
12 | 297ab63281a975 |
13 | cb5c465b3c497 |
14 | 5417642767797 |
15 | 24a689863811b |
hex | 110f3098c59e9 |
300111000001001 has 16 divisors (see below), whose sum is σ = 363299583596544. Its totient is φ = 242012983486464.
The previous prime is 300111000000997. The next prime is 300111000001031. The reversal of 300111000001001 is 100100000111003.
It is a cyclic number.
It is not a de Polignac number, because 300111000001001 - 22 = 300111000000997 is a prime.
It is a super-2 number, since 2×3001110000010012 (a number of 30 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 300111000001001.
It is not an unprimeable number, because it can be changed into a prime (300111000001031) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 485989385 + ... + 486606518.
It is an arithmetic number, because the mean of its divisors is an integer number (22706223974784).
Almost surely, 2300111000001001 is an apocalyptic number.
It is an amenable number.
300111000001001 is a deficient number, since it is larger than the sum of its proper divisors (63188583595543).
300111000001001 is a wasteful number, since it uses less digits than its factorization.
300111000001001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 972598520.
The product of its (nonzero) digits is 3, while the sum is 8.
Adding to 300111000001001 its reverse (100100000111003), we get a palindrome (400211000112004).
The spelling of 300111000001001 in words is "three hundred trillion, one hundred eleven billion, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •