Base | Representation |
---|---|
bin | 1101110101101010111010… |
… | …00001101010101101001011 |
3 | 10222202012202212110010221002 |
4 | 12322311131001222231023 |
5 | 12442042003411312230 |
6 | 144415554412205215 |
7 | 6260411363103500 |
oct | 672653501525513 |
9 | 128665685403832 |
10 | 30431404010315 |
11 | 9772982245190 |
12 | 34b598776980b |
13 | 13c9890c965c9 |
14 | 772c602314a7 |
15 | 37b8cd6d4545 |
hex | 1bad5d06ab4b |
30431404010315 has 24 divisors (see below), whose sum is σ = 46341551788272. Its totient is φ = 18970225874880.
The previous prime is 30431404010299. The next prime is 30431404010363. The reversal of 30431404010315 is 51301040413403.
It is a happy number.
It is not a de Polignac number, because 30431404010315 - 24 = 30431404010299 is a prime.
It is a super-3 number, since 3×304314040103153 (a number of 41 digits) contains 333 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5645897864 + ... + 5645903253.
It is an arithmetic number, because the mean of its divisors is an integer number (1930897991178).
Almost surely, 230431404010315 is an apocalyptic number.
30431404010315 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
30431404010315 is a deficient number, since it is larger than the sum of its proper divisors (15910147777957).
30431404010315 is a wasteful number, since it uses less digits than its factorization.
30431404010315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11291801147 (or 11291801140 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 29.
Adding to 30431404010315 its reverse (51301040413403), we get a palindrome (81732444423718).
The spelling of 30431404010315 in words is "thirty trillion, four hundred thirty-one billion, four hundred four million, ten thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •