Base | Representation |
---|---|
bin | 1000101110000101001… |
… | …00011111011000110000 |
3 | 1001122100211102010200220 |
4 | 10113002210133120300 |
5 | 14402103433322242 |
6 | 345350414013040 |
7 | 30434535144060 |
oct | 4270244373060 |
9 | 1048324363626 |
10 | 299617089072 |
11 | 106081043694 |
12 | 4a0991a7180 |
13 | 2233b6c17b2 |
14 | 107043493a0 |
15 | 7bd8c73bec |
hex | 45c291f630 |
299617089072 has 160 divisors (see below), whose sum is σ = 905222062080. Its totient is φ = 83621790720.
The previous prime is 299617089029. The next prime is 299617089181. The reversal of 299617089072 is 270980716992.
It is a junction number, because it is equal to n+sod(n) for n = 299617088997 and 299617089015.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 4041297 + ... + 4114767.
It is an arithmetic number, because the mean of its divisors is an integer number (5657637888).
Almost surely, 2299617089072 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 299617089072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (452611031040).
299617089072 is an abundant number, since it is smaller than the sum of its proper divisors (605604973008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
299617089072 is a wasteful number, since it uses less digits than its factorization.
299617089072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73771 (or 73765 counting only the distinct ones).
The product of its (nonzero) digits is 6858432, while the sum is 60.
The spelling of 299617089072 in words is "two hundred ninety-nine billion, six hundred seventeen million, eighty-nine thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •