Base | Representation |
---|---|
bin | 100000001000111101… |
… | …1001011100000011000 |
3 | 20121011010200121010000 |
4 | 1000101323023200120 |
5 | 2112323132444112 |
6 | 51412450253000 |
7 | 4662246021504 |
oct | 1002173134030 |
9 | 217133617100 |
10 | 69020203032 |
11 | 272a9118110 |
12 | 11462887160 |
13 | 667c462131 |
14 | 34aa847304 |
15 | 1bde5c07dc |
hex | 1011ecb818 |
69020203032 has 160 divisors (see below), whose sum is σ = 211090017600. Its totient is φ = 20895883200.
The previous prime is 69020203027. The next prime is 69020203033. The reversal of 69020203032 is 23030202096.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 69020202987 and 69020203005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (69020203033) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 8970307 + ... + 8977997.
It is an arithmetic number, because the mean of its divisors is an integer number (1319312610).
Almost surely, 269020203032 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 69020203032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (105545008800).
69020203032 is an abundant number, since it is smaller than the sum of its proper divisors (142069814568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
69020203032 is a wasteful number, since it uses less digits than its factorization.
69020203032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8979 (or 8966 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 27.
The spelling of 69020203032 in words is "sixty-nine billion, twenty million, two hundred three thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.137 sec. • engine limits •