Base | Representation |
---|---|
bin | 10011110101101111… |
… | …10110110010001100 |
3 | 1000111022111001011211 |
4 | 21322313312302030 |
5 | 133303224203020 |
6 | 4520532224204 |
7 | 524644245220 |
oct | 117267666214 |
9 | 30438431154 |
10 | 10651397260 |
11 | 4576488459 |
12 | 209316b064 |
13 | 100994043a |
14 | 730888780 |
15 | 42517e85a |
hex | 27adf6c8c |
10651397260 has 144 divisors (see below), whose sum is σ = 27974382912. Its totient is φ = 3325501440.
The previous prime is 10651397249. The next prime is 10651397261. The reversal of 10651397260 is 6279315601.
It is a super-2 number, since 2×106513972602 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10651397261) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2284852 + ... + 2289508.
It is an arithmetic number, because the mean of its divisors is an integer number (194266548).
Almost surely, 210651397260 is an apocalyptic number.
10651397260 is a gapful number since it is divisible by the number (10) 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 10651397260, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13987191456).
10651397260 is an abundant number, since it is smaller than the sum of its proper divisors (17322985652).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10651397260 is a wasteful number, since it uses less digits than its factorization.
10651397260 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4752 (or 4719 counting only the distinct ones).
The product of its (nonzero) digits is 68040, while the sum is 40.
The spelling of 10651397260 in words is "ten billion, six hundred fifty-one million, three hundred ninety-seven thousand, two hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •