Base | Representation |
---|---|
bin | 11100001010101000… |
… | …010110110100000001 |
3 | 2220001200202210122200 |
4 | 130022220112310001 |
5 | 443414214404213 |
6 | 21520555023413 |
7 | 2120311204416 |
oct | 341250266401 |
9 | 86050683580 |
10 | 30243122433 |
11 | 1190a4aa567 |
12 | 5a4043ab69 |
13 | 2b0c86a224 |
14 | 166c85410d |
15 | bc0150273 |
hex | 70aa16d01 |
30243122433 has 6 divisors (see below), whose sum is σ = 43684510194. Its totient is φ = 20162081616.
The previous prime is 30243122423. The next prime is 30243122449. The reversal of 30243122433 is 33422134203.
30243122433 is a `hidden beast` number, since 3 + 0 + 2 + 431 + 224 + 3 + 3 = 666.
It can be written as a sum of positive squares in only one way, i.e., 24126787584 + 6116334849 = 155328^2 + 78207^2 .
It is not a de Polignac number, because 30243122433 - 25 = 30243122401 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30243122397 and 30243122406.
It is not an unprimeable number, because it can be changed into a prime (30243122423) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1680173460 + ... + 1680173477.
It is an arithmetic number, because the mean of its divisors is an integer number (7280751699).
Almost surely, 230243122433 is an apocalyptic number.
It is an amenable number.
30243122433 is a deficient number, since it is larger than the sum of its proper divisors (13441387761).
30243122433 is a wasteful number, since it uses less digits than its factorization.
30243122433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3360346943 (or 3360346940 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 27.
Adding to 30243122433 its reverse (33422134203), we get a palindrome (63665256636).
The spelling of 30243122433 in words is "thirty billion, two hundred forty-three million, one hundred twenty-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •