Base | Representation |
---|---|
bin | 11100010110100100… |
… | …011110000110011111 |
3 | 2220120122200111101200 |
4 | 130112210132012133 |
5 | 444322004232203 |
6 | 21552512210543 |
7 | 2125262613366 |
oct | 342644360637 |
9 | 86518614350 |
10 | 30443430303 |
11 | 11a02582860 |
12 | 5a97539a53 |
13 | 2b422016b0 |
14 | 168b2b67dd |
15 | bd2a1a9a3 |
hex | 71691e19f |
30443430303 has 24 divisors (see below), whose sum is σ = 51661580880. Its totient is φ = 17031288960.
The previous prime is 30443430301. The next prime is 30443430307. The reversal of 30443430303 is 30303434403.
It is not a de Polignac number, because 30443430303 - 21 = 30443430301 is a prime.
It is a super-2 number, since 2×304434303032 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30443430301) 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 23 ways as a sum of consecutive naturals, for example, 11825998 + ... + 11828571.
It is an arithmetic number, because the mean of its divisors is an integer number (2152565870).
Almost surely, 230443430303 is an apocalyptic number.
30443430303 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
30443430303 is a deficient number, since it is larger than the sum of its proper divisors (21218150577).
30443430303 is a wasteful number, since it uses less digits than its factorization.
30443430303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23654599 (or 23654596 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 27.
Adding to 30443430303 its reverse (30303434403), we get a palindrome (60746864706).
The spelling of 30443430303 in words is "thirty billion, four hundred forty-three million, four hundred thirty thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •