Base | Representation |
---|---|
bin | 10011001101100100011… |
… | …100010011011111000000 |
3 | 11200012202210200010120002 |
4 | 103031210130103133000 |
5 | 133112322431220222 |
6 | 2450302051135132 |
7 | 164245531462166 |
oct | 23154434233700 |
9 | 4605683603502 |
10 | 1320240101312 |
11 | 469a02133950 |
12 | 193a558a44a8 |
13 | 9766245a052 |
14 | 47c856d1236 |
15 | 24520cbc392 |
hex | 133647137c0 |
1320240101312 has 56 divisors (see below), whose sum is σ = 2858151826992. Its totient is φ = 600081408000.
The previous prime is 1320240101311. The next prime is 1320240101317. The reversal of 1320240101312 is 2131010420231.
It is a super-2 number, since 2×13202401013122 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1320240101311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 29512562 + ... + 29557262.
It is an arithmetic number, because the mean of its divisors is an integer number (51038425482).
Almost surely, 21320240101312 is an apocalyptic number.
It is an amenable number.
1320240101312 is an abundant number, since it is smaller than the sum of its proper divisors (1537911725680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1320240101312 is a wasteful number, since it uses less digits than its factorization.
1320240101312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86677 (or 86667 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 1320240101312 its reverse (2131010420231), we get a palindrome (3451250521543).
The spelling of 1320240101312 in words is "one trillion, three hundred twenty billion, two hundred forty million, one hundred one thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •