Base | Representation |
---|---|
bin | 10011001110001101000… |
… | …000001110101010110000 |
3 | 11200021112020011102102120 |
4 | 103032031000032222300 |
5 | 133120221133414113 |
6 | 2450453400514240 |
7 | 164301433623033 |
oct | 23161500165260 |
9 | 4607466142376 |
10 | 1320920607408 |
11 | 46a221279186 |
12 | 19400577b980 |
13 | 9774043248c |
14 | 47d0bc3301a |
15 | 245608dda23 |
hex | 1338d00eab0 |
1320920607408 has 40 divisors (see below), whose sum is σ = 3591977092800. Its totient is φ = 417132823104.
The previous prime is 1320920607401. The next prime is 1320920607421. The reversal of 1320920607408 is 8047060290231.
It is a self number, because there is not a number n which added to its sum of digits gives 1320920607408.
It is not an unprimeable number, because it can be changed into a prime (1320920607401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 724188018 + ... + 724189841.
It is an arithmetic number, because the mean of its divisors is an integer number (89799427320).
Almost surely, 21320920607408 is an apocalyptic number.
It is an amenable number.
1320920607408 is an abundant number, since it is smaller than the sum of its proper divisors (2271056485392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1320920607408 is a wasteful number, since it uses less digits than its factorization.
1320920607408 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1448377889 (or 1448377883 counting only the distinct ones).
The product of its (nonzero) digits is 145152, while the sum is 42.
Adding to 1320920607408 its reverse (8047060290231), we get a palindrome (9367980897639).
The spelling of 1320920607408 in words is "one trillion, three hundred twenty billion, nine hundred twenty million, six hundred seven thousand, four hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •