Base | Representation |
---|---|
bin | 10011011110000110… |
… | …11010101001001111 |
3 | 222222111100120000220 |
4 | 21233003122221033 |
5 | 132401443214020 |
6 | 4445130122423 |
7 | 520015615341 |
oct | 115703325117 |
9 | 28874316026 |
10 | 10453101135 |
11 | 4484559664 |
12 | 2038880413 |
13 | ca7831859 |
14 | 7123cb291 |
15 | 412a60240 |
hex | 26f0daa4f |
10453101135 has 32 divisors (see below), whose sum is σ = 16822054080. Its totient is φ = 5542699008.
The previous prime is 10453101133. The next prime is 10453101137. The reversal of 10453101135 is 53110135401.
It is an interprime number because it is at equal distance from previous prime (10453101133) and next prime (10453101137).
It is not a de Polignac number, because 10453101135 - 21 = 10453101133 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10453101133) 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 31 ways as a sum of consecutive naturals, for example, 2825607 + ... + 2829303.
It is an arithmetic number, because the mean of its divisors is an integer number (525689190).
Almost surely, 210453101135 is an apocalyptic number.
10453101135 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10453101135 is a deficient number, since it is larger than the sum of its proper divisors (6368952945).
10453101135 is a wasteful number, since it uses less digits than its factorization.
10453101135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4747.
The product of its (nonzero) digits is 900, while the sum is 24.
Adding to 10453101135 its reverse (53110135401), we get a palindrome (63563236536).
The spelling of 10453101135 in words is "ten billion, four hundred fifty-three million, one hundred one thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •