Base | Representation |
---|---|
bin | 100000001000111101… |
… | …0100001101100000000 |
3 | 20121011010100220011000 |
4 | 1000101322201230000 |
5 | 2112323112003434 |
6 | 51412442452000 |
7 | 4662244406226 |
oct | 1002172415400 |
9 | 217133326130 |
10 | 69020031744 |
11 | 272a9010454 |
12 | 11462804000 |
13 | 667c402191 |
14 | 34aa800b16 |
15 | 1bde589b99 |
hex | 1011ea1b00 |
69020031744 has 144 divisors (see below), whose sum is σ = 204863088640. Its totient is φ = 22921159680.
The previous prime is 69020031737. The next prime is 69020031761. The reversal of 69020031744 is 44713002096.
It is a tau number, because it is divible by the number of its divisors (144).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 69020031699 and 69020031708.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1854729 + ... + 1891575.
Almost surely, 269020031744 is an apocalyptic number.
69020031744 is a gapful number since it is divisible by the number (64) 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 69020031744, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (102431544320).
69020031744 is an abundant number, since it is smaller than the sum of its proper divisors (135843056896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
69020031744 is a wasteful number, since it uses less digits than its factorization.
69020031744 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37143 (or 37123 counting only the distinct ones).
The product of its (nonzero) digits is 36288, while the sum is 36.
The spelling of 69020031744 in words is "sixty-nine billion, twenty million, thirty-one thousand, seven hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.333 sec. • engine limits •