Base | Representation |
---|---|
bin | 11101001110010100111… |
… | …10110000011000100100 |
3 | 10112222211011021200122210 |
4 | 32213022132300120210 |
5 | 112422421324040400 |
6 | 2045142143323420 |
7 | 132355065625515 |
oct | 16471236603044 |
9 | 3488734250583 |
10 | 1004124440100 |
11 | 357935083881 |
12 | 1427332b0570 |
13 | 738c490a142 |
14 | 36858110a0c |
15 | 1b1bd8bc950 |
hex | e9ca7b0624 |
1004124440100 has 36 divisors (see below), whose sum is σ = 2905266714224. Its totient is φ = 267766517280.
The previous prime is 1004124440089. The next prime is 1004124440107. The reversal of 1004124440100 is 10444214001.
It is a super-2 number, since 2×10041244401002 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1004124440107) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 1673540434 + ... + 1673541033.
Almost surely, 21004124440100 is an apocalyptic number.
1004124440100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1004124440100 is an abundant number, since it is smaller than the sum of its proper divisors (1901142274124).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1004124440100 is a wasteful number, since it uses less digits than its factorization.
1004124440100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3347081484 (or 3347081477 counting only the distinct ones).
The product of its (nonzero) digits is 512, while the sum is 21.
Adding to 1004124440100 its reverse (10444214001), we get a palindrome (1014568654101).
The spelling of 1004124440100 in words is "one trillion, four billion, one hundred twenty-four million, four hundred forty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •