Base | Representation |
---|---|
bin | 100111001001… |
… | …000011010010 |
3 | 201022022000120 |
4 | 213021003102 |
5 | 10111320230 |
6 | 1003531110 |
7 | 153133356 |
oct | 47110322 |
9 | 21268016 |
10 | 10260690 |
11 | 5879010 |
12 | 3529a96 |
13 | 218341b |
14 | 1511466 |
15 | d7a310 |
hex | 9c90d2 |
10260690 has 128 divisors (see below), whose sum is σ = 29859840. Its totient is φ = 2227200.
The previous prime is 10260689. The next prime is 10260713. The reversal of 10260690 is 9606201.
It is a super-2 number, since 2×102606902 = 210563518552200, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10260690.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 173881 + ... + 173939.
It is an arithmetic number, because the mean of its divisors is an integer number (233280).
Almost surely, 210260690 is an apocalyptic number.
10260690 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 10260690, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14929920).
10260690 is an abundant number, since it is smaller than the sum of its proper divisors (19599150).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10260690 is a wasteful number, since it uses less digits than its factorization.
10260690 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 128.
The product of its (nonzero) digits is 648, while the sum is 24.
The square root of 10260690 is about 3203.2311811669. The cubic root of 10260690 is about 217.2995643227.
Adding to 10260690 its reverse (9606201), we get a palindrome (19866891).
The spelling of 10260690 in words is "ten million, two hundred sixty thousand, six hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •