Base | Representation |
---|---|
bin | 11100000010001111… |
… | …010101001011110001 |
3 | 2212200212212112112200 |
4 | 130002033111023301 |
5 | 443122200010213 |
6 | 21455005413413 |
7 | 2113651464060 |
oct | 340217251361 |
9 | 85625775480 |
10 | 30102344433 |
11 | 11847a96a07 |
12 | 5a0126a269 |
13 | 2ab9649a35 |
14 | 1657c8a1d7 |
15 | bb2ae3273 |
hex | 7023d52f1 |
30102344433 has 36 divisors (see below), whose sum is σ = 51465480768. Its totient is φ = 16608160800.
The previous prime is 30102344417. The next prime is 30102344473. The reversal of 30102344433 is 33444320103.
It is not a de Polignac number, because 30102344433 - 24 = 30102344417 is a prime.
It is a super-2 number, since 2×301023444332 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30102344397 and 30102344406.
It is not an unprimeable number, because it can be changed into a prime (30102344473) 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 in 35 ways as a sum of consecutive naturals, for example, 231093 + ... + 337058.
It is an arithmetic number, because the mean of its divisors is an integer number (1429596688).
Almost surely, 230102344433 is an apocalyptic number.
It is an amenable number.
30102344433 is a deficient number, since it is larger than the sum of its proper divisors (21363136335).
30102344433 is a wasteful number, since it uses less digits than its factorization.
30102344433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 568222 (or 568190 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 27.
Adding to 30102344433 its reverse (33444320103), we get a palindrome (63546664536).
The spelling of 30102344433 in words is "thirty billion, one hundred two million, three hundred forty-four thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •