Base | Representation |
---|---|
bin | 1101101001100000001000… |
… | …10010001001100010111000 |
3 | 10221021020120201020222212002 |
4 | 12310300010102021202320 |
5 | 12413214221123043000 |
6 | 143455530551440132 |
7 | 6215250431005613 |
oct | 664600422114270 |
9 | 127236521228762 |
10 | 30013303331000 |
11 | 9621630315590 |
12 | 3448942686048 |
13 | 139931c606c42 |
14 | 75a91a11517a |
15 | 370aacb968d5 |
hex | 1b4c044898b8 |
30013303331000 has 128 divisors (see below), whose sum is σ = 76619273664960. Its totient is φ = 10913430528000.
The previous prime is 30013303330999. The next prime is 30013303331087. The reversal of 30013303331000 is 13330331003.
It is a super-2 number, since 2×300133033310002 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 312274952 + ... + 312371048.
Almost surely, 230013303331000 is an apocalyptic number.
It is an amenable number.
30013303331000 is an abundant number, since it is smaller than the sum of its proper divisors (46605970333960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30013303331000 is a wasteful number, since it uses less digits than its factorization.
30013303331000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124522 (or 124508 counting only the distinct ones).
The product of its (nonzero) digits is 729, while the sum is 20.
Adding to 30013303331000 its reverse (13330331003), we get a palindrome (30026633662003).
It can be divided in two parts, 30013303 and 331000, that added together give a palindrome (30344303).
The spelling of 30013303331000 in words is "thirty trillion, thirteen billion, three hundred three million, three hundred thirty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •