Base | Representation |
---|---|
bin | 1001011110001001000100… |
… | …0010101101101011111000 |
3 | 1100212111220010111022010120 |
4 | 2113202101002231223320 |
5 | 2331103203114230430 |
6 | 34051510545213240 |
7 | 2123226414446445 |
oct | 227422102555370 |
9 | 40774803438116 |
10 | 10413434133240 |
11 | 33553490aa576 |
12 | 120223a031220 |
13 | 5a6ca0a9b218 |
14 | 2800275889cc |
15 | 130d25e45610 |
hex | 978910adaf8 |
10413434133240 has 64 divisors (see below), whose sum is σ = 31240606642560. Its totient is φ = 2776888725120.
The previous prime is 10413434133163. The next prime is 10413434133253. The reversal of 10413434133240 is 4233143431401.
It is a super-2 number, since 2×104134341332402 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13990567 + ... + 14716073.
It is an arithmetic number, because the mean of its divisors is an integer number (488134478790).
Almost surely, 210413434133240 is an apocalyptic number.
10413434133240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10413434133240 is an abundant number, since it is smaller than the sum of its proper divisors (20827172509320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10413434133240 is a wasteful number, since it uses less digits than its factorization.
10413434133240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 845132 (or 845128 counting only the distinct ones).
The product of its (nonzero) digits is 41472, while the sum is 33.
Adding to 10413434133240 its reverse (4233143431401), we get a palindrome (14646577564641).
The spelling of 10413434133240 in words is "ten trillion, four hundred thirteen billion, four hundred thirty-four million, one hundred thirty-three thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •