Base | Representation |
---|---|
bin | 10011011110000110… |
… | …11010011110001001 |
3 | 222222111100112001121 |
4 | 21233003122132021 |
5 | 132401443203200 |
6 | 4445130115241 |
7 | 520015613305 |
oct | 115703323611 |
9 | 28874315047 |
10 | 10453100425 |
11 | 4484559079 |
12 | 203887bb21 |
13 | ca7831431 |
14 | 7123cad05 |
15 | 412a5ee1a |
hex | 26f0da789 |
10453100425 has 6 divisors (see below), whose sum is σ = 12961844558. Its totient is φ = 8362480320.
The previous prime is 10453100417. The next prime is 10453100443. The reversal of 10453100425 is 52400135401.
It is a happy number.
It can be written as a sum of positive squares in 3 ways, for example, as 4376464 + 10448723961 = 2092^2 + 102219^2 .
It is not a de Polignac number, because 10453100425 - 23 = 10453100417 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (25), and also a Moran number because the ratio is a prime number: 418124017 = 10453100425 / (1 + 0 + 4 + 5 + 3 + 1 + 0 + 0 + 4 + 2 + 5).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10453100425.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 209061984 + ... + 209062033.
Almost surely, 210453100425 is an apocalyptic number.
It is an amenable number.
10453100425 is a deficient number, since it is larger than the sum of its proper divisors (2508744133).
10453100425 is an equidigital number, since it uses as much as digits as its factorization.
10453100425 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 418124027 (or 418124022 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 25.
Adding to 10453100425 its reverse (52400135401), we get a palindrome (62853235826).
The spelling of 10453100425 in words is "ten billion, four hundred fifty-three million, one hundred thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •