Base | Representation |
---|---|
bin | 100000001011011001… |
… | …1010010011010000000 |
3 | 20121100211122100012101 |
4 | 1000112303102122000 |
5 | 2113010104121344 |
6 | 51424532040144 |
7 | 4664261323546 |
oct | 1002663223200 |
9 | 217324570171 |
10 | 69102020224 |
11 | 2734031a626 |
12 | 11486163054 |
13 | 66933aa683 |
14 | 34b7663d96 |
15 | 1be68829d4 |
hex | 1016cd2680 |
69102020224 has 32 divisors (see below), whose sum is σ = 138047738400. Its totient is φ = 34454744832.
The previous prime is 69102020219. The next prime is 69102020233. The reversal of 69102020224 is 42202020196.
It is a tau number, because it is divible by the number of its divisors (32).
It is a super-3 number, since 3×691020202243 (a number of 33 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 69102020192 and 69102020201.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 705942 + ... + 797845.
It is an arithmetic number, because the mean of its divisors is an integer number (4313991825).
Almost surely, 269102020224 is an apocalyptic number.
69102020224 is a gapful number since it is divisible by the number (64) formed by its first and last digit.
It is an amenable number.
69102020224 is a deficient number, since it is larger than the sum of its proper divisors (68945718176).
69102020224 is a wasteful number, since it uses less digits than its factorization.
69102020224 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1504160 (or 1504148 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 28.
Subtracting from 69102020224 its sum of digits (28), we obtain a palindrome (69102020196).
The spelling of 69102020224 in words is "sixty-nine billion, one hundred two million, twenty thousand, two hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •