Base | Representation |
---|---|
bin | 1011110110100100011001… |
… | …1010110100010001011001 |
3 | 1201010212011022021212110212 |
4 | 2331221012122310101121 |
5 | 3202004231211223113 |
6 | 43414511504420505 |
7 | 2513352614033036 |
oct | 275510632642131 |
9 | 51125138255425 |
10 | 13032112211033 |
11 | 4174984662183 |
12 | 1565864017735 |
13 | 736bcc825416 |
14 | 330a86bb838d |
15 | 178edd93b0a8 |
hex | bda466b4459 |
13032112211033 has 2 divisors, whose sum is σ = 13032112211034. Its totient is φ = 13032112211032.
The previous prime is 13032112211017. The next prime is 13032112211047. The reversal of 13032112211033 is 33011221123031.
13032112211033 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12946445945689 + 85666265344 = 3598117^2 + 292688^2 .
It is a cyclic number.
It is not a de Polignac number, because 13032112211033 - 24 = 13032112211017 is a prime.
It is not a weakly prime, because it can be changed into another prime (13032112211233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6516056105516 + 6516056105517.
It is an arithmetic number, because the mean of its divisors is an integer number (6516056105517).
Almost surely, 213032112211033 is an apocalyptic number.
It is an amenable number.
13032112211033 is a deficient number, since it is larger than the sum of its proper divisors (1).
13032112211033 is an equidigital number, since it uses as much as digits as its factorization.
13032112211033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 13032112211033 its reverse (33011221123031), we get a palindrome (46043333334064).
The spelling of 13032112211033 in words is "thirteen trillion, thirty-two billion, one hundred twelve million, two hundred eleven thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •