Base | Representation |
---|---|
bin | 100000010000100101… |
… | …0001011011001101000 |
3 | 20121210221121220122010 |
4 | 1000201022023121220 |
5 | 2113334100334000 |
6 | 51454100355520 |
7 | 5001501344661 |
oct | 1004112133150 |
9 | 217727556563 |
10 | 69275793000 |
11 | 2741a419697 |
12 | 115143a5ba0 |
13 | 66c03b0cbb |
14 | 34d277a368 |
15 | 1c06c5ad50 |
hex | 102128b668 |
69275793000 has 512 divisors, whose sum is σ = 235494604800. Its totient is φ = 16904448000.
The previous prime is 69275792987. The next prime is 69275793007. The reversal of 69275793000 is 39757296.
It is not an unprimeable number, because it can be changed into a prime (69275793007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 297320884 + ... + 297321116.
It is an arithmetic number, because the mean of its divisors is an integer number (459950400).
Almost surely, 269275793000 is an apocalyptic number.
69275793000 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 69275793000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (117747302400).
69275793000 is an abundant number, since it is smaller than the sum of its proper divisors (166218811800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
69275793000 is a wasteful number, since it uses less digits than its factorization.
69275793000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 450 (or 436 counting only the distinct ones).
The product of its (nonzero) digits is 714420, while the sum is 48.
The spelling of 69275793000 in words is "sixty-nine billion, two hundred seventy-five million, seven hundred ninety-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •