Base | Representation |
---|---|
bin | 1000010101011… |
… | …11101101101100 |
3 | 11212120121002020 |
4 | 10022233231230 |
5 | 120400110430 |
6 | 10534430140 |
7 | 1506234063 |
oct | 412575554 |
9 | 155517066 |
10 | 69925740 |
11 | 36520275 |
12 | 1b502350 |
13 | 11643aa1 |
14 | 94031da |
15 | 6213b10 |
hex | 42afb6c |
69925740 has 48 divisors (see below), whose sum is σ = 200352768. Its totient is φ = 18212544.
The previous prime is 69925733. The next prime is 69925747. The reversal of 69925740 is 4752996.
It is an interprime number because it is at equal distance from previous prime (69925733) and next prime (69925747).
It is a super-2 number, since 2×699257402 = 9779218229095200, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 69925692 and 69925701.
It is not an unprimeable number, because it can be changed into a prime (69925747) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10972 + ... + 16131.
It is an arithmetic number, because the mean of its divisors is an integer number (4174016).
Almost surely, 269925740 is an apocalyptic number.
69925740 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
69925740 is an abundant number, since it is smaller than the sum of its proper divisors (130427028).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
69925740 is a wasteful number, since it uses less digits than its factorization.
69925740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27158 (or 27156 counting only the distinct ones).
The product of its (nonzero) digits is 136080, while the sum is 42.
The square root of 69925740 is about 8362.1612038994. The cubic root of 69925740 is about 411.9827419170.
The spelling of 69925740 in words is "sixty-nine million, nine hundred twenty-five thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •