Base | Representation |
---|---|
bin | 1101101001001101001010… |
… | …10011111100010111110111 |
3 | 10221020021022000120202201002 |
4 | 12310212211103330113313 |
5 | 12413032342211444343 |
6 | 143451124300153515 |
7 | 6214440166253153 |
oct | 664464523742767 |
9 | 127207260522632 |
10 | 30003120031223 |
11 | 9618285094759 |
12 | 344698023889b |
13 | 139838895b981 |
14 | 75a2318ba063 |
15 | 3706b3b7c8b8 |
hex | 1b49a54fc5f7 |
30003120031223 has 8 divisors (see below), whose sum is σ = 30815296743840. Its totient is φ = 29191010770080.
The previous prime is 30003120031177. The next prime is 30003120031327. The reversal of 30003120031223 is 32213002130003.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30003120031223 - 210 = 30003120030199 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30003120031195 and 30003120031204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30003120030223) 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, 15960563 + ... + 17741076.
It is an arithmetic number, because the mean of its divisors is an integer number (3851912092980).
Almost surely, 230003120031223 is an apocalyptic number.
30003120031223 is a deficient number, since it is larger than the sum of its proper divisors (812176712617).
30003120031223 is a wasteful number, since it uses less digits than its factorization.
30003120031223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33725737.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 30003120031223 its reverse (32213002130003), we get a palindrome (62216122161226).
The spelling of 30003120031223 in words is "thirty trillion, three billion, one hundred twenty million, thirty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •