Base | Representation |
---|---|
bin | 1001100000101001000011… |
… | …1110010101001011100101 |
3 | 1101000121202021201101012010 |
4 | 2120022100332111023211 |
5 | 2332304132430013003 |
6 | 34123332413144433 |
7 | 2126306624050251 |
oct | 230122076251345 |
9 | 41017667641163 |
10 | 10456382657253 |
11 | 337158845a315 |
12 | 120a62548b119 |
13 | 5ab056980b40 |
14 | 28213d59d261 |
15 | 131edb704003 |
hex | 98290f952e5 |
10456382657253 has 48 divisors (see below), whose sum is σ = 15534785228928. Its totient is φ = 6218883216000.
The previous prime is 10456382657167. The next prime is 10456382657291. The reversal of 10456382657253 is 35275628365401.
It is not a de Polignac number, because 10456382657253 - 210 = 10456382656229 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10456382657193 and 10456382657202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10456382657053) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 28187328 + ... + 28555878.
It is an arithmetic number, because the mean of its divisors is an integer number (323641358936).
Almost surely, 210456382657253 is an apocalyptic number.
10456382657253 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
10456382657253 is a deficient number, since it is larger than the sum of its proper divisors (5078402571675).
10456382657253 is a wasteful number, since it uses less digits than its factorization.
10456382657253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 369386 (or 369355 counting only the distinct ones).
The product of its (nonzero) digits is 36288000, while the sum is 57.
The spelling of 10456382657253 in words is "ten trillion, four hundred fifty-six billion, three hundred eighty-two million, six hundred fifty-seven thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.394 sec. • engine limits •