Base | Representation |
---|---|
bin | 11100010110000101… |
… | …011011011001111111 |
3 | 2220120002101001211122 |
4 | 130112011123121333 |
5 | 444312413332144 |
6 | 21552021541155 |
7 | 2125133502032 |
oct | 342605333177 |
9 | 86502331748 |
10 | 30435292799 |
11 | 119a8a24a4a |
12 | 5a948747bb |
13 | 2b406127c2 |
14 | 168a199019 |
15 | bd1e5e7ee |
hex | 71615b67f |
30435292799 has 4 divisors (see below), whose sum is σ = 30654251880. Its totient is φ = 30216333720.
The previous prime is 30435292739. The next prime is 30435292807. The reversal of 30435292799 is 99729253403.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 99729253403 = 13 ⋅7671481031.
It is a cyclic number.
It is not a de Polignac number, because 30435292799 - 224 = 30418515583 is a prime.
It is a super-2 number, since 2×304352927992 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 30435292799.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30435292739) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 109479332 + ... + 109479609.
It is an arithmetic number, because the mean of its divisors is an integer number (7663562970).
Almost surely, 230435292799 is an apocalyptic number.
30435292799 is a deficient number, since it is larger than the sum of its proper divisors (218959081).
30435292799 is a wasteful number, since it uses less digits than its factorization.
30435292799 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 218959080.
The product of its (nonzero) digits is 3674160, while the sum is 53.
The spelling of 30435292799 in words is "thirty billion, four hundred thirty-five million, two hundred ninety-two thousand, seven hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •