Base | Representation |
---|---|
bin | 1101101111010100101010… |
… | …00010110100010111000101 |
3 | 10221222100210212020001102222 |
4 | 12313222111002310113011 |
5 | 12430003314412112010 |
6 | 144131444301142125 |
7 | 6235560515636633 |
oct | 667522502642705 |
9 | 127870725201388 |
10 | 30213300504005 |
11 | 9699430525823 |
12 | 347b65925a945 |
13 | 13b2143176428 |
14 | 76648da9c353 |
15 | 375db5c5d355 |
hex | 1b7a950b45c5 |
30213300504005 has 8 divisors (see below), whose sum is σ = 36256196788224. Its totient is φ = 24170482947600.
The previous prime is 30213300503987. The next prime is 30213300504019. The reversal of 30213300504005 is 50040500331203.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30213300504005 - 26 = 30213300503941 is a prime.
It is a super-3 number, since 3×302133005040053 (a number of 41 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18834341 + ... + 20375450.
It is an arithmetic number, because the mean of its divisors is an integer number (4532024598528).
Almost surely, 230213300504005 is an apocalyptic number.
It is an amenable number.
30213300504005 is a deficient number, since it is larger than the sum of its proper divisors (6042896284219).
30213300504005 is a wasteful number, since it uses less digits than its factorization.
30213300504005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39363907.
The product of its (nonzero) digits is 5400, while the sum is 26.
Adding to 30213300504005 its reverse (50040500331203), we get a palindrome (80253800835208).
The spelling of 30213300504005 in words is "thirty trillion, two hundred thirteen billion, three hundred million, five hundred four thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •