Base | Representation |
---|---|
bin | 10010111000110011… |
… | …11101100010011101 |
3 | 222011200122202220020 |
4 | 21130121331202131 |
5 | 131231400303000 |
6 | 4354112342353 |
7 | 506166436644 |
oct | 113431754235 |
9 | 28150582806 |
10 | 10140244125 |
11 | 43339a3550 |
12 | 1b6bb449b9 |
13 | c57a8196b |
14 | 6c2a2c35b |
15 | 3e5361ba0 |
hex | 25c67d89d |
10140244125 has 128 divisors (see below), whose sum is σ = 18966085632. Its totient is φ = 4769280000.
The previous prime is 10140244123. The next prime is 10140244151. The reversal of 10140244125 is 52144204101.
It is not a de Polignac number, because 10140244125 - 21 = 10140244123 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10140244095 and 10140244104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10140244123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 37417740 + ... + 37418010.
It is an arithmetic number, because the mean of its divisors is an integer number (148172544).
Almost surely, 210140244125 is an apocalyptic number.
10140244125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10140244125 is a deficient number, since it is larger than the sum of its proper divisors (8825841507).
10140244125 is a wasteful number, since it uses less digits than its factorization.
10140244125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 540 (or 530 counting only the distinct ones).
The product of its (nonzero) digits is 1280, while the sum is 24.
Adding to 10140244125 its reverse (52144204101), we get a palindrome (62284448226).
The spelling of 10140244125 in words is "ten billion, one hundred forty million, two hundred forty-four thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •