Base | Representation |
---|---|
bin | 11100001010101101… |
… | …001110110100101110 |
3 | 2220001210011201201220 |
4 | 130022231032310232 |
5 | 443420031303210 |
6 | 21521042244210 |
7 | 2120325106356 |
oct | 341255166456 |
9 | 86053151656 |
10 | 30244400430 |
11 | 119101a2762 |
12 | 5a40956666 |
13 | 2b0cbc6b3a |
14 | 166caa7b66 |
15 | bc0303c70 |
hex | 70ab4ed2e |
30244400430 has 16 divisors (see below), whose sum is σ = 72586561104. Its totient is φ = 8065173440.
The previous prime is 30244400429. The next prime is 30244400437. The reversal of 30244400430 is 3400444203.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 30244400430.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30244400437) 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 7 ways as a sum of consecutive naturals, for example, 504073311 + ... + 504073370.
It is an arithmetic number, because the mean of its divisors is an integer number (4536660069).
Almost surely, 230244400430 is an apocalyptic number.
30244400430 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
30244400430 is an abundant number, since it is smaller than the sum of its proper divisors (42342160674).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30244400430 is a wasteful number, since it uses less digits than its factorization.
30244400430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1008146691.
The product of its (nonzero) digits is 4608, while the sum is 24.
Adding to 30244400430 its reverse (3400444203), we get a palindrome (33644844633).
The spelling of 30244400430 in words is "thirty billion, two hundred forty-four million, four hundred thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •