Base | Representation |
---|---|
bin | 1001010100001000010011… |
… | …0111111110100001101011 |
3 | 1100021001220221211001120220 |
4 | 2111002010313332201223 |
5 | 2320243422403101303 |
6 | 33440503143421123 |
7 | 2104630133500065 |
oct | 225020467764153 |
9 | 40231827731526 |
10 | 10241431300203 |
11 | 3299403a80294 |
12 | 1194a367547a3 |
13 | 5939bbc1743c |
14 | 27598b91a735 |
15 | 12b60a878053 |
hex | 95084dfe86b |
10241431300203 has 32 divisors (see below), whose sum is σ = 13832975211264. Its totient is φ = 6739194000000.
The previous prime is 10241431300183. The next prime is 10241431300237. The reversal of 10241431300203 is 30200313414201.
It is a happy number.
10241431300203 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10241431300203 - 213 = 10241431292011 is a prime.
It is a super-2 number, since 2×102414313002032 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10241431300403) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 185066248 + ... + 185121578.
It is an arithmetic number, because the mean of its divisors is an integer number (432280475352).
Almost surely, 210241431300203 is an apocalyptic number.
10241431300203 is a deficient number, since it is larger than the sum of its proper divisors (3591543911061).
10241431300203 is a wasteful number, since it uses less digits than its factorization.
10241431300203 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 57307.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 10241431300203 its reverse (30200313414201), we get a palindrome (40441744714404).
The spelling of 10241431300203 in words is "ten trillion, two hundred forty-one billion, four hundred thirty-one million, three hundred thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •