Base | Representation |
---|---|
bin | 11100010101100100… |
… | …010010110011111001 |
3 | 2220112111000202221111 |
4 | 130111210102303321 |
5 | 444303202404331 |
6 | 21551111440321 |
7 | 2124666614401 |
oct | 342544226371 |
9 | 86474022844 |
10 | 30426606841 |
11 | 119a4032074 |
12 | 5a919860a1 |
13 | 2b3b891097 |
14 | 1688d77801 |
15 | bd12e5db1 |
hex | 715912cf9 |
30426606841 has 4 divisors (see below), whose sum is σ = 30441875572. Its totient is φ = 30411338112.
The previous prime is 30426606799. The next prime is 30426606871. The reversal of 30426606841 is 14860662403.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 14860662403 = 397 ⋅37432399.
It can be written as a sum of positive squares in 2 ways, for example, as 14471127616 + 15955479225 = 120296^2 + 126315^2 .
It is a cyclic number.
It is not a de Polignac number, because 30426606841 - 27 = 30426606713 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30426606794 and 30426606803.
It is not an unprimeable number, because it can be changed into a prime (30426606871) 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, 7631376 + ... + 7635361.
It is an arithmetic number, because the mean of its divisors is an integer number (7610468893).
Almost surely, 230426606841 is an apocalyptic number.
It is an amenable number.
30426606841 is a deficient number, since it is larger than the sum of its proper divisors (15268731).
30426606841 is a wasteful number, since it uses less digits than its factorization.
30426606841 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15268730.
The product of its (nonzero) digits is 165888, while the sum is 40.
The spelling of 30426606841 in words is "thirty billion, four hundred twenty-six million, six hundred six thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •