Base | Representation |
---|---|
bin | 1101101001001001011011… |
… | …01011111010110101011111 |
3 | 10221020002010011002120200100 |
4 | 12310210231223322311133 |
5 | 12413014234420103323 |
6 | 143450153203432143 |
7 | 6214336356225252 |
oct | 664445553726537 |
9 | 127202104076610 |
10 | 30001113050463 |
11 | 961744520a375 |
12 | 3446500085653 |
13 | 1398128c0c0a9 |
14 | 75a0c1125099 |
15 | 3705e788b943 |
hex | 1b492dafad5f |
30001113050463 has 24 divisors (see below), whose sum is σ = 43399848632400. Its totient is φ = 19970806068864.
The previous prime is 30001113050393. The next prime is 30001113050473. The reversal of 30001113050463 is 36405031110003.
30001113050463 is a `hidden beast` number, since 300 + 0 + 1 + 11 + 305 + 0 + 46 + 3 = 666.
It is not a de Polignac number, because 30001113050463 - 221 = 30001110953311 is a prime.
It is a super-2 number, since 2×300011130504632 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30001113050473) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 15983928 + ... + 17761986.
It is an arithmetic number, because the mean of its divisors is an integer number (1808327026350).
Almost surely, 230001113050463 is an apocalyptic number.
30001113050463 is a deficient number, since it is larger than the sum of its proper divisors (13398735581937).
30001113050463 is a wasteful number, since it uses less digits than its factorization.
30001113050463 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1780871 (or 1780868 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 27.
Adding to 30001113050463 its reverse (36405031110003), we get a palindrome (66406144160466).
The spelling of 30001113050463 in words is "thirty trillion, one billion, one hundred thirteen million, fifty thousand, four hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •