Base | Representation |
---|---|
bin | 10110110101001101000000… |
… | …011010101001111010000100 |
3 | 111011112101211001121222212201 |
4 | 112311031000122221322010 |
5 | 101130132033003024104 |
6 | 553321052342324244 |
7 | 30102415515000610 |
oct | 2665150032517204 |
9 | 434471731558781 |
10 | 100413121142404 |
11 | 29aa3a69136014 |
12 | b31889b129684 |
13 | 4404bbbc8cb75 |
14 | 1ab2041876340 |
15 | b91e980990a4 |
hex | 5b53406a9e84 |
100413121142404 has 48 divisors (see below), whose sum is σ = 200989047309568. Its totient is φ = 42999310867968.
The previous prime is 100413121142393. The next prime is 100413121142413. The reversal of 100413121142404 is 404241121314001.
It is a happy number.
It is a super-3 number, since 3×1004131211424043 (a number of 43 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1149676624 + ... + 1149763960.
Almost surely, 2100413121142404 is an apocalyptic number.
100413121142404 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
100413121142404 is an abundant number, since it is smaller than the sum of its proper divisors (100575926167164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100413121142404 is a wasteful number, since it uses less digits than its factorization.
100413121142404 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120164 (or 120162 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 28.
Adding to 100413121142404 its reverse (404241121314001), we get a palindrome (504654242456405).
The spelling of 100413121142404 in words is "one hundred trillion, four hundred thirteen billion, one hundred twenty-one million, one hundred forty-two thousand, four hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •