Base | Representation |
---|---|
bin | 10001011110110001110… |
… | …111100100000011111000 |
3 | 11020211201021021021110110 |
4 | 101132301313210003320 |
5 | 124140210140232230 |
6 | 2315505503344320 |
7 | 152534560411041 |
oct | 21366167440370 |
9 | 4224637237413 |
10 | 1201280008440 |
11 | 42350727a406 |
12 | 1749962b20a0 |
13 | 89384843355 |
14 | 421dc5238c8 |
15 | 213ac27c4b0 |
hex | 117b1de40f8 |
1201280008440 has 64 divisors (see below), whose sum is σ = 3604049460000. Its totient is φ = 320322719232.
The previous prime is 1201280008427. The next prime is 1201280008447. The reversal of 1201280008440 is 448000821021.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 1201280008398 and 1201280008407.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1201280008447) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1847874 + ... + 2411886.
Almost surely, 21201280008440 is an apocalyptic number.
1201280008440 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1201280008440 is an abundant number, since it is smaller than the sum of its proper divisors (2402769451560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1201280008440 is a wasteful number, since it uses less digits than its factorization.
1201280008440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 581776 (or 581772 counting only the distinct ones).
The product of its (nonzero) digits is 4096, while the sum is 30.
Adding to 1201280008440 its reverse (448000821021), we get a palindrome (1649280829461).
The spelling of 1201280008440 in words is "one trillion, two hundred one billion, two hundred eighty million, eight thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •