Base | Representation |
---|---|
bin | 1001011010000011110111… |
… | …1011000100000100010100 |
3 | 1100121210220202122111210220 |
4 | 2112200331323010010110 |
5 | 2323431104424021400 |
6 | 33555353343114340 |
7 | 2115165054403221 |
oct | 226407573040424 |
9 | 40553822574726 |
10 | 10343320142100 |
11 | 3328639630250 |
12 | 11b0730ba29b0 |
13 | 5a04a8b519ba |
14 | 27a89577c948 |
15 | 12e0c08197a0 |
hex | 9683dec4114 |
10343320142100 has 144 divisors (see below), whose sum is σ = 32835993986880. Its totient is φ = 2492977356800.
The previous prime is 10343320142033. The next prime is 10343320142159. The reversal of 10343320142100 is 124102334301.
It is a happy number.
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 47 ways as a sum of consecutive naturals, for example, 8487885 + ... + 9629684.
It is an arithmetic number, because the mean of its divisors is an integer number (228027736020).
Almost surely, 210343320142100 is an apocalyptic number.
10343320142100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10343320142100 is an abundant number, since it is smaller than the sum of its proper divisors (22492673844780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10343320142100 is a wasteful number, since it uses less digits than its factorization.
10343320142100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18117770 (or 18117763 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 10343320142100 its reverse (124102334301), we get a palindrome (10467422476401).
The spelling of 10343320142100 in words is "ten trillion, three hundred forty-three billion, three hundred twenty million, one hundred forty-two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •