Base | Representation |
---|---|
bin | 1101110100110100100011… |
… | …01011000010100100011101 |
3 | 10222122102110011021211111101 |
4 | 12322122101223002210131 |
5 | 12441102222430001000 |
6 | 144354331015153101 |
7 | 6255326262260350 |
oct | 672322153024435 |
9 | 128572404254441 |
10 | 30402222500125 |
11 | 9761568020713 |
12 | 34b01a2975791 |
13 | 13c6bc0359308 |
14 | 7716927a6297 |
15 | 37ac71885e6a |
hex | 1ba691ac291d |
30402222500125 has 256 divisors, whose sum is σ = 47233489305600. Its totient is φ = 19086851097600.
The previous prime is 30402222500077. The next prime is 30402222500179. The reversal of 30402222500125 is 52100522220403.
It is not a de Polignac number, because 30402222500125 - 219 = 30402221975837 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30402222500093 and 30402222500102.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 19501104096 + ... + 19501105654.
It is an arithmetic number, because the mean of its divisors is an integer number (184505817600).
Almost surely, 230402222500125 is an apocalyptic number.
30402222500125 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
It is an amenable number.
30402222500125 is a deficient number, since it is larger than the sum of its proper divisors (16831266805475).
30402222500125 is a wasteful number, since it uses less digits than its factorization.
30402222500125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2093 (or 2083 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 28.
Adding to 30402222500125 its reverse (52100522220403), we get a palindrome (82502744720528).
The spelling of 30402222500125 in words is "thirty trillion, four hundred two billion, two hundred twenty-two million, five hundred thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •