Base | Representation |
---|---|
bin | 11101001110010100110… |
… | …01110011100000111000 |
3 | 10112222211001211202021102 |
4 | 32213022121303200320 |
5 | 112422421011022300 |
6 | 2045142055430532 |
7 | 132355051611533 |
oct | 16471231634070 |
9 | 3488731752242 |
10 | 1004123142200 |
11 | 357934377732 |
12 | 142732985448 |
13 | 738c4574459 |
14 | 36857c93a1a |
15 | 1b1bd7130d5 |
hex | e9ca673838 |
1004123142200 has 48 divisors (see below), whose sum is σ = 2336722757880. Its totient is φ = 401281695360.
The previous prime is 1004123142199. The next prime is 1004123142203. The reversal of 1004123142200 is 22413214001.
1004123142200 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1004123142203) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2078114 + ... + 2515313.
Almost surely, 21004123142200 is an apocalyptic number.
1004123142200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1004123142200 is an abundant number, since it is smaller than the sum of its proper divisors (1332599615680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1004123142200 is a wasteful number, since it uses less digits than its factorization.
1004123142200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4594536 (or 4594527 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 1004123142200 its reverse (22413214001), we get a palindrome (1026536356201).
The spelling of 1004123142200 in words is "one trillion, four billion, one hundred twenty-three million, one hundred forty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •