Base | Representation |
---|---|
bin | 10011110101101110… |
… | …10000111101000100 |
3 | 1000111022012011121212 |
4 | 21322313100331010 |
5 | 133303204223213 |
6 | 4520525030552 |
7 | 524643031400 |
oct | 117267207504 |
9 | 30438164555 |
10 | 10651242308 |
11 | 4576391aa3 |
12 | 20930b5458 |
13 | 10098b7a55 |
14 | 730848100 |
15 | 42514d9a8 |
hex | 27add0f44 |
10651242308 has 72 divisors (see below), whose sum is σ = 22373366400. Its totient is φ = 4421656512.
The previous prime is 10651242307. The next prime is 10651242367. The reversal of 10651242308 is 80324215601.
It is a super-2 number, since 2×106512423082 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10651242307) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 814163 + ... + 827141.
It is an arithmetic number, because the mean of its divisors is an integer number (310741200).
Almost surely, 210651242308 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10651242308, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11186683200).
10651242308 is an abundant number, since it is smaller than the sum of its proper divisors (11722124092).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10651242308 is a wasteful number, since it uses less digits than its factorization.
10651242308 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13129 (or 13120 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 32.
Adding to 10651242308 its reverse (80324215601), we get a palindrome (90975457909).
The spelling of 10651242308 in words is "ten billion, six hundred fifty-one million, two hundred forty-two thousand, three hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •