Base | Representation |
---|---|
bin | 1101110000000110111100… |
… | …11010110001100010010001 |
3 | 10222001221111121000211220012 |
4 | 12320003132122301202101 |
5 | 12430424114114340213 |
6 | 144152111434324305 |
7 | 6240534600061004 |
oct | 670033632614221 |
9 | 128057447024805 |
10 | 30240301324433 |
11 | 96a9926809852 |
12 | 3484933889695 |
13 | 13b4857083555 |
14 | 7678d1a7553b |
15 | 3769464064a8 |
hex | 1b80de6b1891 |
30240301324433 has 16 divisors (see below), whose sum is σ = 30672487714176. Its totient is φ = 29811451038720.
The previous prime is 30240301324427. The next prime is 30240301324451. The reversal of 30240301324433 is 33442310304203.
It is a cyclic number.
It is not a de Polignac number, because 30240301324433 - 212 = 30240301320337 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 30240301324433.
It is not an unprimeable number, because it can be changed into a prime (30240301324483) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 27032660 + ... + 28129082.
It is an arithmetic number, because the mean of its divisors is an integer number (1917030482136).
Almost surely, 230240301324433 is an apocalyptic number.
It is an amenable number.
30240301324433 is a deficient number, since it is larger than the sum of its proper divisors (432186389743).
30240301324433 is a wasteful number, since it uses less digits than its factorization.
30240301324433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1097944.
The product of its (nonzero) digits is 62208, while the sum is 32.
Adding to 30240301324433 its reverse (33442310304203), we get a palindrome (63682611628636).
The spelling of 30240301324433 in words is "thirty trillion, two hundred forty billion, three hundred one million, three hundred twenty-four thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •