Base | Representation |
---|---|
bin | 1010111010100011101101… |
… | …0001101111100011110100 |
3 | 1120111022000121021011201001 |
4 | 2232220323101233203310 |
5 | 3033111310040211040 |
6 | 41305124445013044 |
7 | 2346024160330264 |
oct | 256507321574364 |
9 | 46438017234631 |
10 | 12001133132020 |
11 | 390771986974a |
12 | 1419a97254184 |
13 | 6909183a0cc6 |
14 | 2d6c022a37a4 |
15 | 15c29c64d59a |
hex | aea3b46f8f4 |
12001133132020 has 12 divisors (see below), whose sum is σ = 25202379577284. Its totient is φ = 4800453252800.
The previous prime is 12001133131973. The next prime is 12001133132041. The reversal of 12001133132020 is 2023133110021.
It can be written as a sum of positive squares in 2 ways, for example, as 4082323266576 + 7918809865444 = 2020476^2 + 2814038^2 .
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 300028328281 + ... + 300028328320.
It is an arithmetic number, because the mean of its divisors is an integer number (2100198298107).
Almost surely, 212001133132020 is an apocalyptic number.
12001133132020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12001133132020 is an abundant number, since it is smaller than the sum of its proper divisors (13201246445264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12001133132020 is a wasteful number, since it uses less digits than its factorization.
12001133132020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 600056656610 (or 600056656608 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 12001133132020 its reverse (2023133110021), we get a palindrome (14024266242041).
The spelling of 12001133132020 in words is "twelve trillion, one billion, one hundred thirty-three million, one hundred thirty-two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •