Base | Representation |
---|---|
bin | 1001010111100011101110… |
… | …0001111100100000001001 |
3 | 1100110200221201201210022102 |
4 | 2111320323201330200021 |
5 | 2322230034031030441 |
6 | 33523523442203145 |
7 | 2112113534131346 |
oct | 225707341744011 |
9 | 40420851653272 |
10 | 10300330330121 |
11 | 3311388a40217 |
12 | 11a43339534b5 |
13 | 599417544230 |
14 | 27877809b7cd |
15 | 12ce0660269b |
hex | 95e3b87c809 |
10300330330121 has 16 divisors (see below), whose sum is σ = 11182198030080. Its totient is φ = 9431503686720.
The previous prime is 10300330330111. The next prime is 10300330330133. The reversal of 10300330330121 is 12103303300301.
It is a cyclic number.
It is not a de Polignac number, because 10300330330121 - 210 = 10300330329097 is a prime.
It is a super-2 number, since 2×103003303301212 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10300330330093 and 10300330330102.
It is not an unprimeable number, because it can be changed into a prime (10300330330111) 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, 4229045 + ... + 6203666.
It is an arithmetic number, because the mean of its divisors is an integer number (698887376880).
Almost surely, 210300330330121 is an apocalyptic number.
It is an amenable number.
10300330330121 is a deficient number, since it is larger than the sum of its proper divisors (881867699959).
10300330330121 is a wasteful number, since it uses less digits than its factorization.
10300330330121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10433336.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 10300330330121 its reverse (12103303300301), we get a palindrome (22403633630422).
The spelling of 10300330330121 in words is "ten trillion, three hundred billion, three hundred thirty million, three hundred thirty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •