Base | Representation |
---|---|
bin | 1101101110111110100101… |
… | …01110010100010110010111 |
3 | 10221221020020000012012000112 |
4 | 12313133102232110112113 |
5 | 12424310032301244021 |
6 | 144122204344433235 |
7 | 6234661044563654 |
oct | 667372256242627 |
9 | 127836200165015 |
10 | 30201450415511 |
11 | 96943aa455961 |
12 | 34792b077881b |
13 | 13b0ca50ac44b |
14 | 765a87d44c2b |
15 | 375920750d5b |
hex | 1b77d2b94597 |
30201450415511 has 8 divisors (see below), whose sum is σ = 31792810282800. Its totient is φ = 28610271532800.
The previous prime is 30201450415463. The next prime is 30201450415547. The reversal of 30201450415511 is 11551405410203.
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 30201450415511 - 234 = 30184270546327 is a prime.
It is a super-2 number, since 2×302014504155112 (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 (30201450415811) 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, 44903540 + ... + 45571161.
It is an arithmetic number, because the mean of its divisors is an integer number (3974101285350).
Almost surely, 230201450415511 is an apocalyptic number.
30201450415511 is a deficient number, since it is larger than the sum of its proper divisors (1591359867289).
30201450415511 is a wasteful number, since it uses less digits than its factorization.
30201450415511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90492289.
The product of its (nonzero) digits is 12000, while the sum is 32.
Adding to 30201450415511 its reverse (11551405410203), we get a palindrome (41752855825714).
The spelling of 30201450415511 in words is "thirty trillion, two hundred one billion, four hundred fifty million, four hundred fifteen thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •