Base | Representation |
---|---|
bin | 1101101010000001001011… |
… | …01110101100110111100111 |
3 | 10221022221101010002021110101 |
4 | 12311000211232230313213 |
5 | 12414012034322124111 |
6 | 143512023223004531 |
7 | 6216446163021610 |
oct | 665004556546747 |
9 | 127287333067411 |
10 | 30031044333031 |
11 | 9629104688a35 |
12 | 3450273b99747 |
13 | 139abb8c94391 |
14 | 75b7203a2c07 |
15 | 37129a43ebc1 |
hex | 1b5025bacde7 |
30031044333031 has 8 divisors (see below), whose sum is σ = 35813419329024. Its totient is φ = 24621725788440.
The previous prime is 30031044333029. The next prime is 30031044333061. The reversal of 30031044333031 is 13033344013003.
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 30031044333031 - 21 = 30031044333029 is a prime.
It is a super-2 number, since 2×300310443330312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30031044333061) 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, 93264112675 + ... + 93264112996.
It is an arithmetic number, because the mean of its divisors is an integer number (4476677416128).
Almost surely, 230031044333031 is an apocalyptic number.
30031044333031 is a deficient number, since it is larger than the sum of its proper divisors (5782374995993).
30031044333031 is a wasteful number, since it uses less digits than its factorization.
30031044333031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 186528225701.
The product of its (nonzero) digits is 11664, while the sum is 28.
Adding to 30031044333031 its reverse (13033344013003), we get a palindrome (43064388346034).
The spelling of 30031044333031 in words is "thirty trillion, thirty-one billion, forty-four million, three hundred thirty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •