Base | Representation |
---|---|
bin | 1101110101011001111111… |
… | …01110001100000111001101 |
3 | 10222201100022221212002022220 |
4 | 12322230333232030013031 |
5 | 12441414404020233123 |
6 | 144411453314325553 |
7 | 6256640336666244 |
oct | 672547756140715 |
9 | 128640287762286 |
10 | 30422322430413 |
11 | 976a0419a3851 |
12 | 34b40722898b9 |
13 | 13c8a74651aa4 |
14 | 77263c06195b |
15 | 37b54b290ce3 |
hex | 1bab3fb8c1cd |
30422322430413 has 4 divisors (see below), whose sum is σ = 40563096573888. Its totient is φ = 20281548286940.
The previous prime is 30422322430399. The next prime is 30422322430457. The reversal of 30422322430413 is 31403422322403.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 30422322430413 - 222 = 30422318236109 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30422322430463) 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, 5070387071733 + ... + 5070387071738.
It is an arithmetic number, because the mean of its divisors is an integer number (10140774143472).
Almost surely, 230422322430413 is an apocalyptic number.
It is an amenable number.
30422322430413 is a deficient number, since it is larger than the sum of its proper divisors (10140774143475).
30422322430413 is a wasteful number, since it uses less digits than its factorization.
30422322430413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10140774143474.
The product of its (nonzero) digits is 82944, while the sum is 33.
Adding to 30422322430413 its reverse (31403422322403), we get a palindrome (61825744752816).
The spelling of 30422322430413 in words is "thirty trillion, four hundred twenty-two billion, three hundred twenty-two million, four hundred thirty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •