Base | Representation |
---|---|
bin | 100010000111000000011010… |
… | …1000001111101011000101101 |
3 | 1110100022121012021201000201212 |
4 | 1010032000311001331120231 |
5 | 303311143144013313110 |
6 | 2542035534154244205 |
7 | 120124314124056140 |
oct | 10416006501753055 |
9 | 1410277167630655 |
10 | 300030125135405 |
11 | 87665074962645 |
12 | 29797a21a26665 |
13 | cb549476a1422 |
14 | 541376d736057 |
15 | 24a4713454e05 |
hex | 110e03507d62d |
300030125135405 has 32 divisors (see below), whose sum is σ = 412192147852800. Its totient is φ = 205374127041792.
The previous prime is 300030125135401. The next prime is 300030125135443. The reversal of 300030125135405 is 504531521030003.
It is a cyclic number.
It is not a de Polignac number, because 300030125135405 - 22 = 300030125135401 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (300030125135401) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 42444131 + ... + 49005759.
It is an arithmetic number, because the mean of its divisors is an integer number (12881004620400).
Almost surely, 2300030125135405 is an apocalyptic number.
300030125135405 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
It is an amenable number.
300030125135405 is a deficient number, since it is larger than the sum of its proper divisors (112162022717395).
300030125135405 is a wasteful number, since it uses less digits than its factorization.
300030125135405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6563933.
The product of its (nonzero) digits is 27000, while the sum is 32.
Adding to 300030125135405 its reverse (504531521030003), we get a palindrome (804561646165408).
The spelling of 300030125135405 in words is "three hundred trillion, thirty billion, one hundred twenty-five million, one hundred thirty-five thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •