Base | Representation |
---|---|
bin | 1101101001001101001100… |
… | …00110001011111100110111 |
3 | 10221020021022221100220221012 |
4 | 12310212212012023330313 |
5 | 12413032404044432411 |
6 | 143451125450342435 |
7 | 6214440416230460 |
oct | 664464606137467 |
9 | 127207287326835 |
10 | 30003133202231 |
11 | 9618291570292 |
12 | 344698472aa1b |
13 | 139838b5c0977 |
14 | 75a233547d67 |
15 | 3706b4dd018b |
hex | 1b49a618bf37 |
30003133202231 has 16 divisors (see below), whose sum is σ = 34704740093184. Its totient is φ = 25405429009344.
The previous prime is 30003133202201. The next prime is 30003133202243. The reversal of 30003133202231 is 13220233130003.
It is a cyclic number.
It is not a de Polignac number, because 30003133202231 - 218 = 30003132940087 is a prime.
It is a super-2 number, since 2×300031332022312 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30003133202197 and 30003133202206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30003133202201) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7005476 + ... + 10444278.
It is an arithmetic number, because the mean of its divisors is an integer number (2169046255824).
Almost surely, 230003133202231 is an apocalyptic number.
30003133202231 is a deficient number, since it is larger than the sum of its proper divisors (4701606890953).
30003133202231 is a wasteful number, since it uses less digits than its factorization.
30003133202231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3453910.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 30003133202231 its reverse (13220233130003), we get a palindrome (43223366332234).
The spelling of 30003133202231 in words is "thirty trillion, three billion, one hundred thirty-three million, two hundred two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •