Base | Representation |
---|---|
bin | 1101101001010001011111… |
… | …10110001011000011001111 |
3 | 10221020111022000000211021010 |
4 | 12310220233312023003033 |
5 | 12413102122212310142 |
6 | 143452151044340303 |
7 | 6214551611005404 |
oct | 664505766130317 |
9 | 127214260024233 |
10 | 30005444260047 |
11 | 9619268054223 |
12 | 344730a6a4693 |
13 | 1398669337cb9 |
14 | 75a3b24542ab |
15 | 37079cc37e9c |
hex | 1b4a2fd8b0cf |
30005444260047 has 4 divisors (see below), whose sum is σ = 40007259013400. Its totient is φ = 20003629506696.
The previous prime is 30005444260039. The next prime is 30005444260063. The reversal of 30005444260047 is 74006244450003.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 30005444260047 - 23 = 30005444260039 is a prime.
It is a super-3 number, since 3×300054442600473 (a number of 41 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30005444259987 and 30005444260014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30005444260027) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5000907376672 + ... + 5000907376677.
It is an arithmetic number, because the mean of its divisors is an integer number (10001814753350).
Almost surely, 230005444260047 is an apocalyptic number.
30005444260047 is a deficient number, since it is larger than the sum of its proper divisors (10001814753353).
30005444260047 is a wasteful number, since it uses less digits than its factorization.
30005444260047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10001814753352.
The product of its (nonzero) digits is 322560, while the sum is 39.
The spelling of 30005444260047 in words is "thirty trillion, five billion, four hundred forty-four million, two hundred sixty thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •