Base | Representation |
---|---|
bin | 1000001110000… |
… | …01011000000000 |
3 | 11210201222221100 |
4 | 10013001120000 |
5 | 120122341004 |
6 | 10501454400 |
7 | 1465026651 |
oct | 407013000 |
9 | 153658840 |
10 | 68949504 |
11 | 35a13868 |
12 | 1b111400 |
13 | 11391630 |
14 | 922b528 |
15 | 60be739 |
hex | 41c1600 |
68949504 has 120 divisors (see below), whose sum is σ = 214486272. Its totient is φ = 21196800.
The previous prime is 68949493. The next prime is 68949521. The reversal of 68949504 is 40594986.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 68949504.
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 59329 + ... + 60479.
Almost surely, 268949504 is an apocalyptic number.
68949504 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 68949504, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (107243136).
68949504 is an abundant number, since it is smaller than the sum of its proper divisors (145536768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68949504 is a wasteful number, since it uses less digits than its factorization.
68949504 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1188 (or 1169 counting only the distinct ones).
The product of its (nonzero) digits is 311040, while the sum is 45.
The square root of 68949504 is about 8303.5838045991. The cubic root of 68949504 is about 410.0565141213.
The spelling of 68949504 in words is "sixty-eight million, nine hundred forty-nine thousand, five hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •