Base | Representation |
---|---|
bin | 10011001110010001110… |
… | …011011010000110000100 |
3 | 11200021201211200111222102 |
4 | 103032101303122012010 |
5 | 133120402242214140 |
6 | 2450505354451232 |
7 | 164303432233604 |
oct | 23162163320604 |
9 | 4607654614872 |
10 | 1321001132420 |
11 | 46a262778882 |
12 | 194028733b18 |
13 | 97754017808 |
14 | 47d187d4c04 |
15 | 245679e7e15 |
hex | 13391cda184 |
1321001132420 has 24 divisors (see below), whose sum is σ = 2775266600064. Its totient is φ = 528178696416.
The previous prime is 1321001132383. The next prime is 1321001132441. The reversal of 1321001132420 is 242311001231.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 1321001132392 and 1321001132401.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13810934 + ... + 13906253.
It is an arithmetic number, because the mean of its divisors is an integer number (115636108336).
Almost surely, 21321001132420 is an apocalyptic number.
1321001132420 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1321001132420 is an abundant number, since it is smaller than the sum of its proper divisors (1454265467644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1321001132420 is a wasteful number, since it uses less digits than its factorization.
1321001132420 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27719579 (or 27719577 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 1321001132420 its reverse (242311001231), we get a palindrome (1563312133651).
The spelling of 1321001132420 in words is "one trillion, three hundred twenty-one billion, one million, one hundred thirty-two thousand, four hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •