Base | Representation |
---|---|
bin | 10011000101001100… |
… | …01101110111001010 |
3 | 222102221010012211020 |
4 | 21202212031313022 |
5 | 131434443320020 |
6 | 4412303013310 |
7 | 511600404045 |
oct | 114246156712 |
9 | 28387105736 |
10 | 10244120010 |
11 | 43875a1a93 |
12 | 1b9a89a236 |
13 | c73451697 |
14 | 6d274bc5c |
15 | 3ee52ec40 |
hex | 26298ddca |
10244120010 has 64 divisors (see below), whose sum is σ = 24784531200. Its totient is φ = 2709780480.
The previous prime is 10244119997. The next prime is 10244120011. The reversal of 10244120010 is 1002144201.
10244120010 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10244120011) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 2104980 + ... + 2109840.
It is an arithmetic number, because the mean of its divisors is an integer number (387258300).
Almost surely, 210244120010 is an apocalyptic number.
10244120010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10244120010 is an abundant number, since it is smaller than the sum of its proper divisors (14540411190).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10244120010 is a wasteful number, since it uses less digits than its factorization.
10244120010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5423.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 10244120010 its reverse (1002144201), we get a palindrome (11246264211).
The spelling of 10244120010 in words is "ten billion, two hundred forty-four million, one hundred twenty thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •