Base | Representation |
---|---|
bin | 1101101001001011101100… |
… | …10010000101000001010001 |
3 | 10221020012021000220111110101 |
4 | 12310211312102011001101 |
5 | 12413024233214410301 |
6 | 143450514112532401 |
7 | 6214411505566111 |
oct | 664456622050121 |
9 | 127205230814411 |
10 | 30002331013201 |
11 | 9617a0a774848 |
12 | 344679bb51101 |
13 | 13982913525c1 |
14 | 75a198bad041 |
15 | 370669774701 |
hex | 1b4976485051 |
30002331013201 has 8 divisors (see below), whose sum is σ = 31318743101184. Its totient is φ = 28686915834720.
The previous prime is 30002331013189. The next prime is 30002331013261. The reversal of 30002331013201 is 10231013320003.
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 30002331013201 - 225 = 30002297458769 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30002331013261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 249165865 + ... + 249286246.
It is an arithmetic number, because the mean of its divisors is an integer number (3914842887648).
Almost surely, 230002331013201 is an apocalyptic number.
It is an amenable number.
30002331013201 is a deficient number, since it is larger than the sum of its proper divisors (1316412087983).
30002331013201 is a wasteful number, since it uses less digits than its factorization.
30002331013201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 498454751.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 30002331013201 its reverse (10231013320003), we get a palindrome (40233344333204).
The spelling of 30002331013201 in words is "thirty trillion, two billion, three hundred thirty-one million, thirteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •