Base | Representation |
---|---|
bin | 10011011110000111… |
… | …00010011101010101 |
3 | 222222111102011221022 |
4 | 21233003202131111 |
5 | 132402000230031 |
6 | 4445130530525 |
7 | 520016110553 |
oct | 115703423525 |
9 | 28874364838 |
10 | 10453133141 |
11 | 4484580710 |
12 | 2038896a45 |
13 | ca78432a9 |
14 | 7123d8bd3 |
15 | 412a6997b |
hex | 26f0e2755 |
10453133141 has 8 divisors (see below), whose sum is σ = 11436285024. Its totient is φ = 9475459120.
The previous prime is 10453133101. The next prime is 10453133161. The reversal of 10453133141 is 14133135401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10453133141 is a prime.
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 10453133141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10453133101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1365470 + ... + 1373103.
It is an arithmetic number, because the mean of its divisors is an integer number (1429535628).
Almost surely, 210453133141 is an apocalyptic number.
10453133141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10453133141 is a deficient number, since it is larger than the sum of its proper divisors (983151883).
10453133141 is a wasteful number, since it uses less digits than its factorization.
10453133141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2738931.
The product of its (nonzero) digits is 2160, while the sum is 26.
Adding to 10453133141 its reverse (14133135401), we get a palindrome (24586268542).
The spelling of 10453133141 in words is "ten billion, four hundred fifty-three million, one hundred thirty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •