Base | Representation |
---|---|
bin | 1001001110010010001101… |
… | …0100010011111111110100 |
3 | 1022220110201110000100202010 |
4 | 2103210203110103333310 |
5 | 2312122242120010304 |
6 | 33322414341244220 |
7 | 2064443455260201 |
oct | 223444324237764 |
9 | 38813643010663 |
10 | 10141010313204 |
11 | 325a861a45451 |
12 | 117948ba03670 |
13 | 5873a7128984 |
14 | 270b829d0ca8 |
15 | 128bce6d1789 |
hex | 93923513ff4 |
10141010313204 has 12 divisors (see below), whose sum is σ = 23662357397504. Its totient is φ = 3380336771064.
The previous prime is 10141010313197. The next prime is 10141010313211. The reversal of 10141010313204 is 40231301014101.
It is an interprime number because it is at equal distance from previous prime (10141010313197) and next prime (10141010313211).
It is a tau number, because it is divible by the number of its divisors (12).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 422542096372 + ... + 422542096395.
Almost surely, 210141010313204 is an apocalyptic number.
It is an amenable number.
10141010313204 is an abundant number, since it is smaller than the sum of its proper divisors (13521347084300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10141010313204 is a wasteful number, since it uses less digits than its factorization.
10141010313204 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 845084192774 (or 845084192772 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 10141010313204 its reverse (40231301014101), we get a palindrome (50372311327305).
The spelling of 10141010313204 in words is "ten trillion, one hundred forty-one billion, ten million, three hundred thirteen thousand, two hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •