Base | Representation |
---|---|
bin | 1101101001001011101001… |
… | …00000000101011000111111 |
3 | 10221020012011221200021211101 |
4 | 12310211310200011120333 |
5 | 12413024203042132203 |
6 | 143450511124233531 |
7 | 6214410663566005 |
oct | 664456440053077 |
9 | 127205157607741 |
10 | 30002301130303 |
11 | 96179a4914337 |
12 | 3446791b3b8a7 |
13 | 13982880bba08 |
14 | 75a194c30a75 |
15 | 370666d2041d |
hex | 1b497480563f |
30002301130303 has 8 divisors (see below), whose sum is σ = 31770861026688. Its totient is φ = 28234154417664.
The previous prime is 30002301130271. The next prime is 30002301130331. The reversal of 30002301130303 is 30303110320003.
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 30002301130303 - 25 = 30002301130271 is a prime.
It is a super-2 number, since 2×300023011303032 (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 (30002301130603) 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, 103146426 + ... + 103436887.
It is an arithmetic number, because the mean of its divisors is an integer number (3971357628336).
Almost surely, 230002301130303 is an apocalyptic number.
30002301130303 is a deficient number, since it is larger than the sum of its proper divisors (1768559896385).
30002301130303 is a wasteful number, since it uses less digits than its factorization.
30002301130303 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 206591873.
The product of its (nonzero) digits is 486, while the sum is 19.
Adding to 30002301130303 its reverse (30303110320003), we get a palindrome (60305411450306).
The spelling of 30002301130303 in words is "thirty trillion, two billion, three hundred one million, one hundred thirty thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •