Base | Representation |
---|---|
bin | 11011011011010111… |
… | …001101100101111110 |
3 | 2211000102120001010000 |
4 | 123123113031211332 |
5 | 440303211132240 |
6 | 21310145455130 |
7 | 2061541466100 |
oct | 333327154576 |
9 | 84012501100 |
10 | 29450099070 |
11 | 115428a4357 |
12 | 585a9414a6 |
13 | 2a1448aa32 |
14 | 15d53c3570 |
15 | b75705430 |
hex | 6db5cd97e |
29450099070 has 240 divisors, whose sum is σ = 96124758048. Its totient is φ = 6438579840.
The previous prime is 29450099011. The next prime is 29450099071. The reversal of 29450099070 is 7099005492.
29450099070 is digitally balanced in base 5, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (29450099071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 119 ways as a sum of consecutive naturals, for example, 896740 + ... + 929000.
Almost surely, 229450099070 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 29450099070, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (48062379024).
29450099070 is an abundant number, since it is smaller than the sum of its proper divisors (66674658978).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
29450099070 is a wasteful number, since it uses less digits than its factorization.
29450099070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32317 (or 32301 counting only the distinct ones).
The product of its (nonzero) digits is 204120, while the sum is 45.
The spelling of 29450099070 in words is "twenty-nine billion, four hundred fifty million, ninety-nine thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •