Base | Representation |
---|---|
bin | 1101101010000001000110… |
… | …10010001011110001100101 |
3 | 10221022221021020212201212002 |
4 | 12311000203102023301211 |
5 | 12414011443321144023 |
6 | 143512015155335045 |
7 | 6216445154203556 |
oct | 665004322136145 |
9 | 127287236781762 |
10 | 30031003303013 |
11 | 9629093504529 |
12 | 34502622b1485 |
13 | 139abb0629a6b |
14 | 75b718b6232d |
15 | 371296a37b28 |
hex | 1b502348bc65 |
30031003303013 has 8 divisors (see below), whose sum is σ = 30260374732896. Its totient is φ = 29801633799600.
The previous prime is 30031003302991. The next prime is 30031003303033. The reversal of 30031003303013 is 31030330013003.
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 30031003303013 - 210 = 30031003301989 is a prime.
It is a super-2 number, since 2×300310033030132 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30031003303033) 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, 56075678 + ... + 56608688.
It is an arithmetic number, because the mean of its divisors is an integer number (3782546841612).
Almost surely, 230031003303013 is an apocalyptic number.
It is an amenable number.
30031003303013 is a deficient number, since it is larger than the sum of its proper divisors (229371429883).
30031003303013 is a wasteful number, since it uses less digits than its factorization.
30031003303013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 963235.
The product of its (nonzero) digits is 729, while the sum is 20.
Adding to 30031003303013 its reverse (31030330013003), we get a palindrome (61061333316016).
The spelling of 30031003303013 in words is "thirty trillion, thirty-one billion, three million, three hundred three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •