Base | Representation |
---|---|
bin | 10010110111000001… |
… | …01001101010110110 |
3 | 222010122101111101221 |
4 | 21123200221222312 |
5 | 131214024024114 |
6 | 4352414340554 |
7 | 505624645252 |
oct | 113340515266 |
9 | 28118344357 |
10 | 10125220534 |
11 | 4326472060 |
12 | 1b66aba75a |
13 | c54921670 |
14 | 6c0a3b262 |
15 | 3e3d95524 |
hex | 25b829ab6 |
10125220534 has 16 divisors (see below), whose sum is σ = 17843046480. Its totient is φ = 4248344160.
The previous prime is 10125220531. The next prime is 10125220537. The reversal of 10125220534 is 43502252101.
10125220534 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (10125220531) and next prime (10125220537).
It is a junction number, because it is equal to n+sod(n) for n = 10125220499 and 10125220508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10125220531) 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 7 ways as a sum of consecutive naturals, for example, 17701149 + ... + 17701720.
It is an arithmetic number, because the mean of its divisors is an integer number (1115190405).
Almost surely, 210125220534 is an apocalyptic number.
10125220534 is a deficient number, since it is larger than the sum of its proper divisors (7717825946).
10125220534 is a wasteful number, since it uses less digits than its factorization.
10125220534 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35402895.
The product of its (nonzero) digits is 2400, while the sum is 25.
Adding to 10125220534 its reverse (43502252101), we get a palindrome (53627472635).
The spelling of 10125220534 in words is "ten billion, one hundred twenty-five million, two hundred twenty thousand, five hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •