Base | Representation |
---|---|
bin | 1101101100001001101100… |
… | …00010100010100001001011 |
3 | 10221120221112200112111002200 |
4 | 12312010312002202201023 |
5 | 12421212133044204003 |
6 | 144005423412531243 |
7 | 6224652264306342 |
oct | 666046602424113 |
9 | 127527480474080 |
10 | 30104332413003 |
11 | 96571a2913172 |
12 | 3462508020b23 |
13 | 13a4a986a9584 |
14 | 7610b3970b59 |
15 | 37313954b6a3 |
hex | 1b61360a284b |
30104332413003 has 12 divisors (see below), whose sum is σ = 43489326486840. Its totient is φ = 20067113043936.
The previous prime is 30104332412953. The next prime is 30104332413037. The reversal of 30104332413003 is 30031423340103.
30104332413003 is a `hidden beast` number, since 30 + 1 + 0 + 4 + 3 + 324 + 1 + 300 + 3 = 666.
It is not a de Polignac number, because 30104332413003 - 233 = 30095742478411 is a prime.
It is not an unprimeable number, because it can be changed into a prime (30104332413803) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 203413426 + ... + 203561367.
It is an arithmetic number, because the mean of its divisors is an integer number (3624110540570).
Almost surely, 230104332413003 is an apocalyptic number.
30104332413003 is a deficient number, since it is larger than the sum of its proper divisors (13384994073837).
30104332413003 is a wasteful number, since it uses less digits than its factorization.
30104332413003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 406983018 (or 406983015 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 27.
Adding to 30104332413003 its reverse (30031423340103), we get a palindrome (60135755753106).
The spelling of 30104332413003 in words is "thirty trillion, one hundred four billion, three hundred thirty-two million, four hundred thirteen thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •