Base | Representation |
---|---|
bin | 1010111011010001000110… |
… | …1110111001000100101001 |
3 | 1120112110110222221122100011 |
4 | 2232310101232321010221 |
5 | 3033311240141010402 |
6 | 41314502110011521 |
7 | 2346635202634306 |
oct | 256642156710451 |
9 | 46473428848304 |
10 | 12013321031977 |
11 | 3911903599341 |
12 | 1420318aa6ba1 |
13 | 691b0b444425 |
14 | 2d763ac340ad |
15 | 15c762637ed7 |
hex | aed11bb9129 |
12013321031977 has 2 divisors, whose sum is σ = 12013321031978. Its totient is φ = 12013321031976.
The previous prime is 12013321031953. The next prime is 12013321032007. The reversal of 12013321031977 is 77913012331021.
12013321031977 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7985207807721 + 4028113224256 = 2825811^2 + 2007016^2 .
It is a cyclic number.
It is not a de Polignac number, because 12013321031977 - 223 = 12013312643369 is a prime.
It is not a weakly prime, because it can be changed into another prime (12013321041977) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6006660515988 + 6006660515989.
It is an arithmetic number, because the mean of its divisors is an integer number (6006660515989).
Almost surely, 212013321031977 is an apocalyptic number.
It is an amenable number.
12013321031977 is a deficient number, since it is larger than the sum of its proper divisors (1).
12013321031977 is an equidigital number, since it uses as much as digits as its factorization.
12013321031977 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 47628, while the sum is 40.
Adding to 12013321031977 its reverse (77913012331021), we get a palindrome (89926333362998).
The spelling of 12013321031977 in words is "twelve trillion, thirteen billion, three hundred twenty-one million, thirty-one thousand, nine hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •