Base | Representation |
---|---|
bin | 1101110000001111110011… |
… | …01100111100110101000101 |
3 | 10222002101202211002212221000 |
4 | 12320013321230330311011 |
5 | 12431013332313311123 |
6 | 144154215213443513 |
7 | 6241063430360511 |
oct | 670077154746505 |
9 | 128071684085830 |
10 | 30245054041413 |
11 | 9700945579422 |
12 | 348583b4a0599 |
13 | 13b5133911313 |
14 | 767c22d67141 |
15 | 376b237b3b43 |
hex | 1b81f9b3cd45 |
30245054041413 has 16 divisors (see below), whose sum is σ = 44807629965760. Its totient is φ = 20163305237328.
The previous prime is 30245054041403. The next prime is 30245054041471. The reversal of 30245054041413 is 31414045054203.
30245054041413 is a `hidden beast` number, since 3 + 0 + 2 + 4 + 505 + 4 + 0 + 4 + 141 + 3 = 666.
It is not a de Polignac number, because 30245054041413 - 25 = 30245054041381 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30245054041403) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7803831 + ... + 11017707.
It is an arithmetic number, because the mean of its divisors is an integer number (2800476872860).
Almost surely, 230245054041413 is an apocalyptic number.
It is an amenable number.
30245054041413 is a deficient number, since it is larger than the sum of its proper divisors (14562575924347).
30245054041413 is a wasteful number, since it uses less digits than its factorization.
30245054041413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3562433 (or 3562427 counting only the distinct ones).
The product of its (nonzero) digits is 115200, while the sum is 36.
Adding to 30245054041413 its reverse (31414045054203), we get a palindrome (61659099095616).
The spelling of 30245054041413 in words is "thirty trillion, two hundred forty-five billion, fifty-four million, forty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •