Base | Representation |
---|---|
bin | 1101101001011110001100… |
… | …01111010100100110001001 |
3 | 10221021010220011120100022111 |
4 | 12310233012033110212021 |
5 | 12413210103133334231 |
6 | 143455235405022321 |
7 | 6215212561161514 |
oct | 664570617244611 |
9 | 127233804510274 |
10 | 30012262402441 |
11 | 9621146787550 |
12 | 34486b1b549a1 |
13 | 13991b4a69697 |
14 | 75a85bb91d7b |
15 | 370a4b5cd4b1 |
hex | 1b4bc63d4989 |
30012262402441 has 8 divisors (see below), whose sum is σ = 33625532323584. Its totient is φ = 26546472886320.
The previous prime is 30012262402411. The next prime is 30012262402469. The reversal of 30012262402441 is 14420426221003.
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 30012262402441 - 29 = 30012262401929 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30012262402411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36870100825 + ... + 36870101638.
It is an arithmetic number, because the mean of its divisors is an integer number (4203191540448).
Almost surely, 230012262402441 is an apocalyptic number.
It is an amenable number.
30012262402441 is a deficient number, since it is larger than the sum of its proper divisors (3613269921143).
30012262402441 is a wasteful number, since it uses less digits than its factorization.
30012262402441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73740202511.
The product of its (nonzero) digits is 18432, while the sum is 31.
Adding to 30012262402441 its reverse (14420426221003), we get a palindrome (44432688623444).
The spelling of 30012262402441 in words is "thirty trillion, twelve billion, two hundred sixty-two million, four hundred two thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •