Base | Representation |
---|---|
bin | 10011100101010111… |
… | …10110001101000001 |
3 | 1000010202000010200022 |
4 | 21302223312031001 |
5 | 133013043001200 |
6 | 4455144103225 |
7 | 521355535562 |
oct | 116253661501 |
9 | 30122003608 |
10 | 10514031425 |
11 | 4505995477 |
12 | 2055164b15 |
13 | cb7346091 |
14 | 71a52c169 |
15 | 418098885 |
hex | 272af6341 |
10514031425 has 48 divisors (see below), whose sum is σ = 13921489920. Its totient is φ = 7854408000.
The previous prime is 10514031383. The next prime is 10514031433. The reversal of 10514031425 is 52413041501.
10514031425 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10514031425 - 218 = 10513769281 is a prime.
It is a super-2 number, since 2×105140314252 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10514031394 and 10514031403.
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 47 ways as a sum of consecutive naturals, for example, 15215330 + ... + 15216020.
It is an arithmetic number, because the mean of its divisors is an integer number (290031040).
Almost surely, 210514031425 is an apocalyptic number.
It is an amenable number.
10514031425 is a deficient number, since it is larger than the sum of its proper divisors (3407458495).
10514031425 is a wasteful number, since it uses less digits than its factorization.
10514031425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1134 (or 1129 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 26.
Adding to 10514031425 its reverse (52413041501), we get a palindrome (62927072926).
The spelling of 10514031425 in words is "ten billion, five hundred fourteen million, thirty-one thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •