Base | Representation |
---|---|
bin | 1001101011100000101001… |
… | …0101100111111011001011 |
3 | 1101200110201002212002211022 |
4 | 2122320022111213323023 |
5 | 2343334033203301303 |
6 | 34345212421223055 |
7 | 2145636666505550 |
oct | 232701225477313 |
9 | 41613632762738 |
10 | 10643102400203 |
11 | 3433794926869 |
12 | 123a855561a8b |
13 | 5c2842823940 |
14 | 28b1b3a00a27 |
15 | 136cb8d17438 |
hex | 9ae0a567ecb |
10643102400203 has 16 divisors (see below), whose sum is σ = 13246385019840. Its totient is φ = 8326299142656.
The previous prime is 10643102400169. The next prime is 10643102400257. The reversal of 10643102400203 is 30200420134601.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10643102400203 is a prime.
It is a super-2 number, since 2×106431024002032 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10643102400263) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 657054650 + ... + 657070847.
It is an arithmetic number, because the mean of its divisors is an integer number (827899063740).
Almost surely, 210643102400203 is an apocalyptic number.
10643102400203 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
10643102400203 is a deficient number, since it is larger than the sum of its proper divisors (2603282619637).
10643102400203 is a wasteful number, since it uses less digits than its factorization.
10643102400203 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1314125606.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 10643102400203 its reverse (30200420134601), we get a palindrome (40843522534804).
The spelling of 10643102400203 in words is "ten trillion, six hundred forty-three billion, one hundred two million, four hundred thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •