Base | Representation |
---|---|
bin | 1001010111100011100111… |
… | …0111000110111010000010 |
3 | 1100110200212210000220012212 |
4 | 2111320321313012322002 |
5 | 2322230004343321310 |
6 | 33523521002022122 |
7 | 2112113044104035 |
oct | 225707167067202 |
9 | 40420783026185 |
10 | 10300302323330 |
11 | 3311374151308 |
12 | 11a43264a7942 |
13 | 5994117b9576 |
14 | 27877448b01c |
15 | 12ce03e1e205 |
hex | 95e39dc6e82 |
10300302323330 has 32 divisors (see below), whose sum is σ = 18756138902400. Its totient is φ = 4072246913152.
The previous prime is 10300302323329. The next prime is 10300302323341. The reversal of 10300302323330 is 3332320300301.
It is a super-3 number, since 3×103003023233303 (a number of 40 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10300302323296 and 10300302323305.
It is an unprimeable number.
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 in 15 ways as a sum of consecutive naturals, for example, 51539 + ... + 4539081.
It is an arithmetic number, because the mean of its divisors is an integer number (586129340700).
Almost surely, 210300302323330 is an apocalyptic number.
10300302323330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10300302323330 is a deficient number, since it is larger than the sum of its proper divisors (8455836579070).
10300302323330 is a wasteful number, since it uses less digits than its factorization.
10300302323330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4490218.
The product of its (nonzero) digits is 2916, while the sum is 23.
Adding to 10300302323330 its reverse (3332320300301), we get a palindrome (13632622623631).
The spelling of 10300302323330 in words is "ten trillion, three hundred billion, three hundred two million, three hundred twenty-three thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •