Base | Representation |
---|---|
bin | 1001101011100001011011… |
… | …0001111111110011101010 |
3 | 1101200111020122200102210212 |
4 | 2122320112301333303222 |
5 | 2343340000124232100 |
6 | 34345245235541122 |
7 | 2145645113125343 |
oct | 232702661776352 |
9 | 41614218612725 |
10 | 10643311164650 |
11 | 343389175566a |
12 | 123a8b345a7a2 |
13 | 5c2876b592b8 |
14 | 28b1d36250ca |
15 | 136ccc303635 |
hex | 9ae16c7fcea |
10643311164650 has 12 divisors (see below), whose sum is σ = 19796558766342. Its totient is φ = 4257324465840.
The previous prime is 10643311164649. The next prime is 10643311164653. The reversal of 10643311164650 is 5646111334601.
It can be written as a sum of positive squares in 3 ways, for example, as 5123400561049 + 5519910603601 = 2263493^2 + 2349449^2 .
It is a super-2 number, since 2×106433111646502 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10643311164598 and 10643311164607.
It is not an unprimeable number, because it can be changed into a prime (10643311164653) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 106433111597 + ... + 106433111696.
Almost surely, 210643311164650 is an apocalyptic number.
10643311164650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10643311164650 is a deficient number, since it is larger than the sum of its proper divisors (9153247601692).
10643311164650 is a wasteful number, since it uses less digits than its factorization.
10643311164650 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 212866223305 (or 212866223300 counting only the distinct ones).
The product of its (nonzero) digits is 155520, while the sum is 41.
The spelling of 10643311164650 in words is "ten trillion, six hundred forty-three billion, three hundred eleven million, one hundred sixty-four thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •