Base | Representation |
---|---|
bin | 1100000111010110000100… |
… | …0000100110101001000000 |
3 | 1202011102002002020002002121 |
4 | 3001311201000212221000 |
5 | 3221220004202224440 |
6 | 44155134314054024 |
7 | 2543234655326101 |
oct | 301654100465100 |
9 | 52142062202077 |
10 | 13320321133120 |
11 | 4276131024091 |
12 | 15b169871a314 |
13 | 75814087b841 |
14 | 3409c7d643a8 |
15 | 18175ad9734a |
hex | c1d61026a40 |
13320321133120 has 28 divisors (see below), whose sum is σ = 31719014699004. Its totient is φ = 5328128453120.
The previous prime is 13320321133109. The next prime is 13320321133123. The reversal of 13320321133120 is 2133112302331.
It can be written as a sum of positive squares in 2 ways, for example, as 5418690084864 + 7901631048256 = 2327808^2 + 2810984^2 .
It is not an unprimeable number, because it can be changed into a prime (13320321133123) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20813001451 + ... + 20813002090.
Almost surely, 213320321133120 is an apocalyptic number.
13320321133120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13320321133120 is an abundant number, since it is smaller than the sum of its proper divisors (18398693565884).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13320321133120 is an equidigital number, since it uses as much as digits as its factorization.
13320321133120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41626003558 (or 41626003548 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 13320321133120 its reverse (2133112302331), we get a palindrome (15453433435451).
The spelling of 13320321133120 in words is "thirteen trillion, three hundred twenty billion, three hundred twenty-one million, one hundred thirty-three thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •