Base | Representation |
---|---|
bin | 1101110100110000101100… |
… | …01110100001000010110101 |
3 | 10222122020002211012022210212 |
4 | 12322120112032201002311 |
5 | 12441034002231101310 |
6 | 144353345312555205 |
7 | 6255224043364142 |
oct | 672302616410265 |
9 | 128566084168725 |
10 | 30400151425205 |
11 | 97606a4a49451 |
12 | 34ab905252b05 |
13 | 13c69502580b3 |
14 | 7715376c93c9 |
15 | 37ab9eb34205 |
hex | 1ba6163a10b5 |
30400151425205 has 8 divisors (see below), whose sum is σ = 36489138322392. Its totient is φ = 24314150065408.
The previous prime is 30400151425093. The next prime is 30400151425249. The reversal of 30400151425205 is 50252415100403.
It can be written as a sum of positive squares in 4 ways, for example, as 5088123841969 + 25312027583236 = 2255687^2 + 5031106^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30400151425205 - 212 = 30400151421109 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 746361944 + ... + 746402673.
It is an arithmetic number, because the mean of its divisors is an integer number (4561142290299).
Almost surely, 230400151425205 is an apocalyptic number.
It is an amenable number.
30400151425205 is a deficient number, since it is larger than the sum of its proper divisors (6088986897187).
30400151425205 is a wasteful number, since it uses less digits than its factorization.
30400151425205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1492768695.
The product of its (nonzero) digits is 24000, while the sum is 32.
Adding to 30400151425205 its reverse (50252415100403), we get a palindrome (80652566525608).
The spelling of 30400151425205 in words is "thirty trillion, four hundred billion, one hundred fifty-one million, four hundred twenty-five thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •