Base | Representation |
---|---|
bin | 11100000100100000… |
… | …100101110100001001 |
3 | 2212210112112011010000 |
4 | 130010200211310021 |
5 | 443211422022213 |
6 | 21502445513213 |
7 | 2114623241421 |
oct | 340440456411 |
9 | 85715464100 |
10 | 30140423433 |
11 | 1186753525a |
12 | 5a11b72809 |
13 | 2ac44c00a3 |
14 | 165cd5d481 |
15 | bb6115c73 |
hex | 704825d09 |
30140423433 has 10 divisors (see below), whose sum is σ = 45024583274. Its totient is φ = 20093615568.
The previous prime is 30140423431. The next prime is 30140423441. The reversal of 30140423433 is 33432404103.
It can be written as a sum of positive squares in only one way, i.e., 30099821049 + 40602384 = 173493^2 + 6372^2 .
It is not a de Polignac number, because 30140423433 - 21 = 30140423431 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30140423397 and 30140423406.
It is not an unprimeable number, because it can be changed into a prime (30140423431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 186051916 + ... + 186052077.
Almost surely, 230140423433 is an apocalyptic number.
It is an amenable number.
30140423433 is a deficient number, since it is larger than the sum of its proper divisors (14884159841).
30140423433 is an equidigital number, since it uses as much as digits as its factorization.
30140423433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 372104005 (or 372103996 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 27.
Adding to 30140423433 its reverse (33432404103), we get a palindrome (63572827536).
The spelling of 30140423433 in words is "thirty billion, one hundred forty million, four hundred twenty-three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •