Base | Representation |
---|---|
bin | 10111100000101110110110… |
… | …101010000100110010111000 |
3 | 111120010100211120112202121001 |
4 | 113200232312222010302320 |
5 | 102023134203421243300 |
6 | 1003531154311254344 |
7 | 30531502323625006 |
oct | 2740566652046270 |
9 | 446110746482531 |
10 | 103404402134200 |
11 | 2aa47619291892 |
12 | b72057107a3b4 |
13 | 4590cbb3136cb |
14 | 1b76b2a7bda76 |
15 | be4bbc11816a |
hex | 5e0bb6a84cb8 |
103404402134200 has 48 divisors (see below), whose sum is σ = 240419392095960. Its totient is φ = 41361045648000.
The previous prime is 103404402134171. The next prime is 103404402134203. The reversal of 103404402134200 is 2431204404301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103404402134203) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 7201270 + ... + 16083130.
Almost surely, 2103404402134200 is an apocalyptic number.
103404402134200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103404402134200 is an abundant number, since it is smaller than the sum of its proper divisors (137014989961760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103404402134200 is a wasteful number, since it uses less digits than its factorization.
103404402134200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8940088 (or 8940079 counting only the distinct ones).
The product of its (nonzero) digits is 9216, while the sum is 28.
Adding to 103404402134200 its reverse (2431204404301), we get a palindrome (105835606538501).
The spelling of 103404402134200 in words is "one hundred three trillion, four hundred four billion, four hundred two million, one hundred thirty-four thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •