Base | Representation |
---|---|
bin | 11110010110101111011… |
… | …10101111111101001000 |
3 | 10200201011120020000112111 |
4 | 33023113232233331020 |
5 | 114042031332121440 |
6 | 2115052004352104 |
7 | 135232355656651 |
oct | 17132756577510 |
9 | 3621146200474 |
10 | 1043001442120 |
11 | 372375139910 |
12 | 14a1830a5634 |
13 | 7747c118b51 |
14 | 386a54b4528 |
15 | 1c1e69c94ea |
hex | f2d7baff48 |
1043001442120 has 64 divisors (see below), whose sum is σ = 2560726483200. Its totient is φ = 379179617280.
The previous prime is 1043001442073. The next prime is 1043001442177. The reversal of 1043001442120 is 212441003401.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 1043001442091 and 1043001442100.
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, 1504192 + ... + 2085328.
It is an arithmetic number, because the mean of its divisors is an integer number (40011351300).
Almost surely, 21043001442120 is an apocalyptic number.
1043001442120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1043001442120 is an abundant number, since it is smaller than the sum of its proper divisors (1517725041080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1043001442120 is a wasteful number, since it uses less digits than its factorization.
1043001442120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 585238 (or 585234 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 1043001442120 its reverse (212441003401), we get a palindrome (1255442445521).
The spelling of 1043001442120 in words is "one trillion, forty-three billion, one million, four hundred forty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •