Base | Representation |
---|---|
bin | 10010101010101110… |
… | …11001011000110010 |
3 | 221212110102000111022 |
4 | 21111113121120302 |
5 | 131011131200000 |
6 | 4334253015442 |
7 | 503233465355 |
oct | 112527313062 |
9 | 27773360438 |
10 | 10022131250 |
11 | 42832605aa |
12 | 1b38484582 |
13 | c394689a1 |
14 | 6b108429c |
15 | 3d9cd0585 |
hex | 2555d9632 |
10022131250 has 24 divisors (see below), whose sum is σ = 18790305156. Its totient is φ = 4008850000.
The previous prime is 10022131187. The next prime is 10022131279. The reversal of 10022131250 is 5213122001.
It is a happy number.
10022131250 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 6 ways, for example, as 4181044921 + 5841086329 = 64661^2 + 76427^2 .
It is a super-3 number, since 3×100221312503 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 795521 + ... + 808020.
Almost surely, 210022131250 is an apocalyptic number.
10022131250 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10022131250 is a deficient number, since it is larger than the sum of its proper divisors (8768173906).
10022131250 is an frugal number, since it uses more digits than its factorization.
10022131250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1603568 (or 1603548 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 17.
Adding to 10022131250 its reverse (5213122001), we get a palindrome (15235253251).
The spelling of 10022131250 in words is "ten billion, twenty-two million, one hundred thirty-one thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •