Base | Representation |
---|---|
bin | 11100000011111010… |
… | …000101101100111000 |
3 | 2212202211112101002212 |
4 | 130003322011230320 |
5 | 443201331033144 |
6 | 21501445314252 |
7 | 2114441403635 |
oct | 340372055470 |
9 | 85684471085 |
10 | 30130330424 |
11 | 11861871227 |
12 | 5a0a705988 |
13 | 2ac23980ac |
14 | 165b89318c |
15 | bb52c049e |
hex | 703e85b38 |
30130330424 has 8 divisors (see below), whose sum is σ = 56494369560. Its totient is φ = 15065165208.
The previous prime is 30130330369. The next prime is 30130330427. The reversal of 30130330424 is 42403303103.
It is a tau number, because it is divible by the number of its divisors (8).
It is a super-2 number, since 2×301303304242 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 30130330424.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30130330427) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1883145644 + ... + 1883145659.
It is an arithmetic number, because the mean of its divisors is an integer number (7061796195).
Almost surely, 230130330424 is an apocalyptic number.
It is an amenable number.
30130330424 is a deficient number, since it is larger than the sum of its proper divisors (26364039136).
30130330424 is a wasteful number, since it uses less digits than its factorization.
30130330424 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3766291309 (or 3766291305 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 23.
Adding to 30130330424 its reverse (42403303103), we get a palindrome (72533633527).
The spelling of 30130330424 in words is "thirty billion, one hundred thirty million, three hundred thirty thousand, four hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •