Base | Representation |
---|---|
bin | 1011110100101101111110… |
… | …0101111011100001111110 |
3 | 1201000211002210222001210122 |
4 | 2331023133211323201332 |
5 | 3200444130002100110 |
6 | 43352133212334542 |
7 | 2511146051166542 |
oct | 275133745734176 |
9 | 51024083861718 |
10 | 13000322300030 |
11 | 416245102555a |
12 | 155b671774452 |
13 | 733c046934b0 |
14 | 32d30cb61a22 |
15 | 17827caed255 |
hex | bd2df97b87e |
13000322300030 has 32 divisors (see below), whose sum is σ = 25200989720928. Its totient is φ = 4800049488000.
The previous prime is 13000322300011. The next prime is 13000322300089. The reversal of 13000322300030 is 3000322300031.
It is a junction number, because it is equal to n+sod(n) for n = 13000322299981 and 13000322300008.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8763365 + ... + 10138895.
It is an arithmetic number, because the mean of its divisors is an integer number (787530928779).
Almost surely, 213000322300030 is an apocalyptic number.
13000322300030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13000322300030 is a deficient number, since it is larger than the sum of its proper divisors (12200667420898).
13000322300030 is a wasteful number, since it uses less digits than its factorization.
13000322300030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1448252.
The product of its (nonzero) digits is 324, while the sum is 17.
Adding to 13000322300030 its reverse (3000322300031), we get a palindrome (16000644600061).
Subtracting from 13000322300030 its reverse (3000322300031), we obtain a palindrome (9999999999999).
The spelling of 13000322300030 in words is "thirteen trillion, three hundred twenty-two million, three hundred thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •