Base | Representation |
---|---|
bin | 1001011000111100011010… |
… | …1110101111000100001111 |
3 | 1100112222102002212102000011 |
4 | 2112033012232233010033 |
5 | 2323122314440134323 |
6 | 33542502242014051 |
7 | 2113615553521243 |
oct | 226170656570417 |
9 | 40488362772004 |
10 | 10324140552463 |
11 | 3320497212721 |
12 | 11a8a79947327 |
13 | 59b7404250aa |
14 | 279996416423 |
15 | 12d84bb0820d |
hex | 963c6baf10f |
10324140552463 has 8 divisors (see below), whose sum is σ = 10931535414000. Its totient is φ = 9716755966080.
The previous prime is 10324140552457. The next prime is 10324140552499. The reversal of 10324140552463 is 36425504142301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10324140552463 - 225 = 10324106998031 is a prime.
It is a super-2 number, since 2×103241405524632 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10324140552443) 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, 450213 + ... + 4566286.
It is an arithmetic number, because the mean of its divisors is an integer number (1366441926750).
Almost surely, 210324140552463 is an apocalyptic number.
10324140552463 is a deficient number, since it is larger than the sum of its proper divisors (607394861537).
10324140552463 is a wasteful number, since it uses less digits than its factorization.
10324140552463 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5137577.
The product of its (nonzero) digits is 345600, while the sum is 40.
Adding to 10324140552463 its reverse (36425504142301), we get a palindrome (46749644694764).
The spelling of 10324140552463 in words is "ten trillion, three hundred twenty-four billion, one hundred forty million, five hundred fifty-two thousand, four hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •