Base | Representation |
---|---|
bin | 1000010000001… |
… | …01000111000000 |
3 | 11211021002111220 |
4 | 10020011013000 |
5 | 120210230234 |
6 | 10511435040 |
7 | 1500263553 |
oct | 410050700 |
9 | 154232456 |
10 | 69226944 |
11 | 36093256 |
12 | 1b225a80 |
13 | 1145a9b7 |
14 | 92a069a |
15 | 6126a49 |
hex | 42051c0 |
69226944 has 56 divisors (see below), whose sum is σ = 189494160. Its totient is φ = 22278144.
The previous prime is 69226943. The next prime is 69226951. The reversal of 69226944 is 44962296.
It is a junction number, because it is equal to n+sod(n) for n = 69226896 and 69226905.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (69226943) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 649 + ... + 11784.
Almost surely, 269226944 is an apocalyptic number.
69226944 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 69226944, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (94747080).
69226944 is an abundant number, since it is smaller than the sum of its proper divisors (120267216).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
69226944 is a wasteful number, since it uses less digits than its factorization.
69226944 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12477 (or 12467 counting only the distinct ones).
The product of its digits is 186624, while the sum is 42.
The square root of 69226944 is about 8320.2730724418. The cubic root of 69226944 is about 410.6057751587.
The spelling of 69226944 in words is "sixty-nine million, two hundred twenty-six thousand, nine hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •