Base | Representation |
---|---|
bin | 1001011110001000001111… |
… | …1000010100000011011100 |
3 | 1100212111022201221221222221 |
4 | 2113202003320110003130 |
5 | 2331102230101144004 |
6 | 34051433020115124 |
7 | 2123221063434511 |
oct | 227420370240334 |
9 | 40774281857887 |
10 | 10413213303004 |
11 | 335524548a546 |
12 | 1202198095aa4 |
13 | 5a6c670cc945 |
14 | 280006103308 |
15 | 130d11874354 |
hex | 97883e140dc |
10413213303004 has 24 divisors (see below), whose sum is σ = 18345013399440. Its totient is φ = 5171887569024.
The previous prime is 10413213302977. The next prime is 10413213303049. The reversal of 10413213303004 is 40030331231401.
It is a super-2 number, since 2×104132133030042 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10413213303004.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12942399 + ... + 13723414.
It is an arithmetic number, because the mean of its divisors is an integer number (764375558310).
Almost surely, 210413213303004 is an apocalyptic number.
It is an amenable number.
10413213303004 is a deficient number, since it is larger than the sum of its proper divisors (7931800096436).
10413213303004 is a wasteful number, since it uses less digits than its factorization.
10413213303004 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26666469 (or 26666467 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 10413213303004 its reverse (40030331231401), we get a palindrome (50443544534405).
The spelling of 10413213303004 in words is "ten trillion, four hundred thirteen billion, two hundred thirteen million, three hundred three thousand, four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •