Base | Representation |
---|---|
bin | 1000010000110… |
… | …10110111010010 |
3 | 11211102121202010 |
4 | 10020122313102 |
5 | 120221103200 |
6 | 10513403350 |
7 | 1501114416 |
oct | 410326722 |
9 | 154377663 |
10 | 69316050 |
11 | 361441a1 |
12 | 1b269556 |
13 | 1148c41b |
14 | 92c4d46 |
15 | 6143150 |
hex | 421add2 |
69316050 has 48 divisors (see below), whose sum is σ = 175167360. Its totient is φ = 18133440.
The previous prime is 69316033. The next prime is 69316057. The reversal of 69316050 is 5061396.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 69315999 and 69316017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (69316057) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3591 + ... + 12309.
It is an arithmetic number, because the mean of its divisors is an integer number (3649320).
Almost surely, 269316050 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 69316050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (87583680).
69316050 is an abundant number, since it is smaller than the sum of its proper divisors (105851310).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
69316050 is a wasteful number, since it uses less digits than its factorization.
69316050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8787 (or 8782 counting only the distinct ones).
The product of its (nonzero) digits is 4860, while the sum is 30.
The square root of 69316050 is about 8325.6261025823. The cubic root of 69316050 is about 410.7818710995.
The spelling of 69316050 in words is "sixty-nine million, three hundred sixteen thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •