Base | Representation |
---|---|
bin | 1101101001001101001010… |
… | …11011100000010000100111 |
3 | 10221020021022011022110111111 |
4 | 12310212211123200100213 |
5 | 12413032343213410343 |
6 | 143451124410445451 |
7 | 6214440222146452 |
oct | 664464533402047 |
9 | 127207264273444 |
10 | 30003122013223 |
11 | 9618286218877 |
12 | 3446980a33887 |
13 | 13983891a3b58 |
14 | 75a231c74499 |
15 | 3706b3e1ec9d |
hex | 1b49a56e0427 |
30003122013223 has 8 divisors (see below), whose sum is σ = 30240889219296. Its totient is φ = 29765868900000.
The previous prime is 30003122013203. The next prime is 30003122013257. The reversal of 30003122013223 is 32231022130003.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30003122013223 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30003122013194 and 30003122013203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30003122013203) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 128406028 + ... + 128639473.
It is an arithmetic number, because the mean of its divisors is an integer number (3780111152412).
Almost surely, 230003122013223 is an apocalyptic number.
30003122013223 is a deficient number, since it is larger than the sum of its proper divisors (237767206073).
30003122013223 is a wasteful number, since it uses less digits than its factorization.
30003122013223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 257046425.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 30003122013223 its reverse (32231022130003), we get a palindrome (62234144143226).
The spelling of 30003122013223 in words is "thirty trillion, three billion, one hundred twenty-two million, thirteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •