Base | Representation |
---|---|
bin | 1101101001000111100101… |
… | …10100111010001011001001 |
3 | 10221012222120022221102111110 |
4 | 12310203302310322023021 |
5 | 12413010224120120210 |
6 | 143445511210120533 |
7 | 6214303035511050 |
oct | 664436264721311 |
9 | 127188508842443 |
10 | 30000125551305 |
11 | 9616a88854668 |
12 | 3446285420149 |
13 | 1397ccc45ab70 |
14 | 75a029d0d397 |
15 | 37058ad29420 |
hex | 1b48f2d3a2c9 |
30000125551305 has 128 divisors (see below), whose sum is σ = 59856763760640. Its totient is φ = 12493263744000.
The previous prime is 30000125551303. The next prime is 30000125551309. The reversal of 30000125551305 is 50315552100003.
It is not a de Polignac number, because 30000125551305 - 21 = 30000125551303 is a prime.
It is not an unprimeable number, because it can be changed into a prime (30000125551303) by changing a digit.
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 127 ways as a sum of consecutive naturals, for example, 36943374 + ... + 37746696.
It is an arithmetic number, because the mean of its divisors is an integer number (467630966880).
Almost surely, 230000125551305 is an apocalyptic number.
30000125551305 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
It is an amenable number.
30000125551305 is a deficient number, since it is larger than the sum of its proper divisors (29856638209335).
30000125551305 is a wasteful number, since it uses less digits than its factorization.
30000125551305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 803711.
The product of its (nonzero) digits is 11250, while the sum is 30.
Adding to 30000125551305 its reverse (50315552100003), we get a palindrome (80315677651308).
The spelling of 30000125551305 in words is "thirty trillion, one hundred twenty-five million, five hundred fifty-one thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •