Base | Representation |
---|---|
bin | 1101110000011110001111… |
… | …01101101010101011011101 |
3 | 10222010010210000110202212200 |
4 | 12320033013231222223131 |
5 | 12431130221124144010 |
6 | 144201540310122113 |
7 | 6241456501122015 |
oct | 670170755525335 |
9 | 128103700422780 |
10 | 30252805303005 |
11 | 97041629a4a3a |
12 | 3487243350339 |
13 | 13b5a9a76403c |
14 | 76835a5a2c45 |
15 | 376e29028cc0 |
hex | 1b83c7b6aadd |
30252805303005 has 12 divisors (see below), whose sum is σ = 52438195858620. Its totient is φ = 16134829494912.
The previous prime is 30252805303001. The next prime is 30252805303051. The reversal of 30252805303005 is 50030350825203.
30252805303005 is a `hidden beast` number, since 3 + 0 + 25 + 280 + 53 + 0 + 300 + 5 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 18758894971716 + 11493910331289 = 4331154^2 + 3390267^2 .
It is not a de Polignac number, because 30252805303005 - 22 = 30252805303001 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30252805303001) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 336142281100 + ... + 336142281189.
It is an arithmetic number, because the mean of its divisors is an integer number (4369849654885).
Almost surely, 230252805303005 is an apocalyptic number.
It is an amenable number.
30252805303005 is a deficient number, since it is larger than the sum of its proper divisors (22185390555615).
30252805303005 is a wasteful number, since it uses less digits than its factorization.
30252805303005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 672284562300 (or 672284562297 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 36.
The spelling of 30252805303005 in words is "thirty trillion, two hundred fifty-two billion, eight hundred five million, three hundred three thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •