Base | Representation |
---|---|
bin | 10011100101011001… |
… | …01011101011010101 |
3 | 1000010202102021010110 |
4 | 21302230223223111 |
5 | 133013122003303 |
6 | 4455152513233 |
7 | 521360440260 |
oct | 116254535325 |
9 | 30122367113 |
10 | 10514250453 |
11 | 4506024a93 |
12 | 205524b819 |
13 | cb73c1995 |
14 | 71a587cd7 |
15 | 4180dd703 |
hex | 272b2bad5 |
10514250453 has 16 divisors (see below), whose sum is σ = 16412489856. Its totient is φ = 5861602560.
The previous prime is 10514250449. The next prime is 10514250473. The reversal of 10514250453 is 35405241501.
It is not a de Polignac number, because 10514250453 - 22 = 10514250449 is a prime.
It is a super-3 number, since 3×105142504533 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 10514250453.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10514250473) 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 15 ways as a sum of consecutive naturals, for example, 6104976 + ... + 6106697.
It is an arithmetic number, because the mean of its divisors is an integer number (1025780616).
Almost surely, 210514250453 is an apocalyptic number.
It is an amenable number.
10514250453 is a deficient number, since it is larger than the sum of its proper divisors (5898239403).
10514250453 is a wasteful number, since it uses less digits than its factorization.
10514250453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12211724.
The product of its (nonzero) digits is 12000, while the sum is 30.
Adding to 10514250453 its reverse (35405241501), we get a palindrome (45919491954).
The spelling of 10514250453 in words is "ten billion, five hundred fourteen million, two hundred fifty thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •