Base | Representation |
---|---|
bin | 10011100101011001… |
… | …01011101011101001 |
3 | 1000010202102021011012 |
4 | 21302230223223221 |
5 | 133013122003343 |
6 | 4455152513305 |
7 | 521360440316 |
oct | 116254535351 |
9 | 30122367135 |
10 | 10514250473 |
11 | 4506025001 |
12 | 205524b835 |
13 | cb73c19ac |
14 | 71a587d0d |
15 | 4180dd718 |
hex | 272b2bae9 |
10514250473 has 2 divisors, whose sum is σ = 10514250474. Its totient is φ = 10514250472.
The previous prime is 10514250449. The next prime is 10514250493. The reversal of 10514250473 is 37405241501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7748752729 + 2765497744 = 88027^2 + 52588^2 .
It is a cyclic number.
It is not a de Polignac number, because 10514250473 - 28 = 10514250217 is a prime.
It is a super-2 number, since 2×105142504732 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10514250493) 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 as a sum of consecutive naturals, namely, 5257125236 + 5257125237.
It is an arithmetic number, because the mean of its divisors is an integer number (5257125237).
Almost surely, 210514250473 is an apocalyptic number.
It is an amenable number.
10514250473 is a deficient number, since it is larger than the sum of its proper divisors (1).
10514250473 is an equidigital number, since it uses as much as digits as its factorization.
10514250473 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16800, while the sum is 32.
Adding to 10514250473 its reverse (37405241501), we get a palindrome (47919491974).
It can be divided in two parts, 1051 and 4250473, that added together give a palindrome (4251524).
The spelling of 10514250473 in words is "ten billion, five hundred fourteen million, two hundred fifty thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •