Base | Representation |
---|---|
bin | 10000000011011100011… |
… | …100101000001110111100 |
3 | 10220110120121110202200200 |
4 | 100003130130220032330 |
5 | 121033333242320444 |
6 | 2202450245323500 |
7 | 142463401204230 |
oct | 20033434501674 |
9 | 3813517422620 |
10 | 1103210120124 |
11 | 395961396832 |
12 | 159986a06590 |
13 | 80055b7b238 |
14 | 3b5779685c0 |
15 | 1da6c6ec969 |
hex | 100dc7283bc |
1103210120124 has 36 divisors (see below), whose sum is σ = 3187051458864. Its totient is φ = 315202891392.
The previous prime is 1103210120119. The next prime is 1103210120141. The reversal of 1103210120124 is 4210210123011.
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 1103210120097 and 1103210120106.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2188908717 + ... + 2188909220.
Almost surely, 21103210120124 is an apocalyptic number.
1103210120124 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
1103210120124 is an abundant number, since it is smaller than the sum of its proper divisors (2083841338740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1103210120124 is a wasteful number, since it uses less digits than its factorization.
1103210120124 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4377817954 (or 4377817949 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 1103210120124 its reverse (4210210123011), we get a palindrome (5313420243135).
The spelling of 1103210120124 in words is "one trillion, one hundred three billion, two hundred ten million, one hundred twenty thousand, one hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •