Base | Representation |
---|---|
bin | 1001011101100011010110… |
… | …1111110000100101000110 |
3 | 1100211112202201212012211120 |
4 | 2113120311233300211012 |
5 | 2330421441000044420 |
6 | 34043114335414410 |
7 | 2122420532143632 |
oct | 227306557604506 |
9 | 40745681765746 |
10 | 10403312503110 |
11 | 335102476aa9a |
12 | 1200294384406 |
13 | 5a6049b35b77 |
14 | 27d747203dc2 |
15 | 13093255dd40 |
hex | 97635bf0946 |
10403312503110 has 32 divisors (see below), whose sum is σ = 24968892084192. Its totient is φ = 2774111992320.
The previous prime is 10403312503093. The next prime is 10403312503151. The reversal of 10403312503110 is 1130521330401.
It is a super-2 number, since 2×104033125031102 (a number of 27 digits) contains 22 as substring.
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 15 ways as a sum of consecutive naturals, for example, 5732211 + ... + 7325630.
It is an arithmetic number, because the mean of its divisors is an integer number (780277877631).
Almost surely, 210403312503110 is an apocalyptic number.
10403312503110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10403312503110 is an abundant number, since it is smaller than the sum of its proper divisors (14565579581082).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10403312503110 is a wasteful number, since it uses less digits than its factorization.
10403312503110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13084408.
The product of its (nonzero) digits is 1080, while the sum is 24.
Adding to 10403312503110 its reverse (1130521330401), we get a palindrome (11533833833511).
The spelling of 10403312503110 in words is "ten trillion, four hundred three billion, three hundred twelve million, five hundred three thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •