Base | Representation |
---|---|
bin | 1011110110000011100100… |
… | …1011000000111101111010 |
3 | 1201010000102011121201002210 |
4 | 2331200321023000331322 |
5 | 3201333204301432310 |
6 | 43410453233035550 |
7 | 2512621341525102 |
oct | 275407113007572 |
9 | 51100364551083 |
10 | 13023300030330 |
11 | 4171172394407 |
12 | 15640049b5bb6 |
13 | 736126c56105 |
14 | 33048c6d4202 |
15 | 178b74eae820 |
hex | bd8392c0f7a |
13023300030330 has 16 divisors (see below), whose sum is σ = 31255920072864. Its totient is φ = 3472880008080.
The previous prime is 13023300030317. The next prime is 13023300030373. The reversal of 13023300030330 is 3303000332031.
It is a junction number, because it is equal to n+sod(n) for n = 13023300030297 and 13023300030306.
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 7 ways as a sum of consecutive naturals, for example, 217055000476 + ... + 217055000535.
It is an arithmetic number, because the mean of its divisors is an integer number (1953495004554).
Almost surely, 213023300030330 is an apocalyptic number.
13023300030330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13023300030330 is an abundant number, since it is smaller than the sum of its proper divisors (18232620042534).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13023300030330 is a wasteful number, since it uses less digits than its factorization.
13023300030330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 434110001021.
The product of its (nonzero) digits is 1458, while the sum is 21.
Adding to 13023300030330 its reverse (3303000332031), we get a palindrome (16326300362361).
The spelling of 13023300030330 in words is "thirteen trillion, twenty-three billion, three hundred million, thirty thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •