Base | Representation |
---|---|
bin | 1001011101100010100111… |
… | …0111111111001001000000 |
3 | 1100211112020212002100020101 |
4 | 2113120221313333021000 |
5 | 2330421034003131222 |
6 | 34043042502452144 |
7 | 2122412563214650 |
oct | 227305167771100 |
9 | 40745225070211 |
10 | 10403113333312 |
11 | 3350a322a4857 |
12 | 1200239734054 |
13 | 5a60177ac70b |
14 | 27d72899a360 |
15 | 13091ed1a927 |
hex | 97629dff240 |
10403113333312 has 112 divisors (see below), whose sum is σ = 25227919559808. Its totient is φ = 4154666803200.
The previous prime is 10403113333307. The next prime is 10403113333321. The reversal of 10403113333312 is 21333331130401.
It is a tau number, because it is divible by the number of its divisors (112).
It is a Harshad number since it is a multiple of its sum of digits (28).
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, 5992938 + ... + 7531369.
It is an arithmetic number, because the mean of its divisors is an integer number (225249281784).
Almost surely, 210403113333312 is an apocalyptic number.
It is an amenable number.
10403113333312 is an abundant number, since it is smaller than the sum of its proper divisors (14824806226496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10403113333312 is a wasteful number, since it uses less digits than its factorization.
10403113333312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13524444 (or 13524434 counting only the distinct ones).
The product of its (nonzero) digits is 5832, while the sum is 28.
Adding to 10403113333312 its reverse (21333331130401), we get a palindrome (31736444463713).
The spelling of 10403113333312 in words is "ten trillion, four hundred three billion, one hundred thirteen million, three hundred thirty-three thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •