Base | Representation |
---|---|
bin | 1011110110100100110110… |
… | …0100001010010011000101 |
3 | 1201010212110122212220200021 |
4 | 2331221031210022103011 |
5 | 3202010002404213221 |
6 | 43414531430215141 |
7 | 2513355601055455 |
oct | 275511544122305 |
9 | 51125418786607 |
10 | 13032232101061 |
11 | 4174a362a9348 |
12 | 15658981b44b1 |
13 | 736c1b611274 |
14 | 330a98aa5d65 |
15 | 178ee921e041 |
hex | bda4d90a4c5 |
13032232101061 has 2 divisors, whose sum is σ = 13032232101062. Its totient is φ = 13032232101060.
The previous prime is 13032232101043. The next prime is 13032232101079. The reversal of 13032232101061 is 16010123223031.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (13032232101043) and next prime (13032232101079).
It can be written as a sum of positive squares in only one way, i.e., 9855392848900 + 3176839252161 = 3139330^2 + 1782369^2 .
It is a cyclic number.
It is not a de Polignac number, because 13032232101061 - 211 = 13032232099013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13032232101461) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6516116050530 + 6516116050531.
It is an arithmetic number, because the mean of its divisors is an integer number (6516116050531).
Almost surely, 213032232101061 is an apocalyptic number.
It is an amenable number.
13032232101061 is a deficient number, since it is larger than the sum of its proper divisors (1).
13032232101061 is an equidigital number, since it uses as much as digits as its factorization.
13032232101061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 13032232101061 its reverse (16010123223031), we get a palindrome (29042355324092).
The spelling of 13032232101061 in words is "thirteen trillion, thirty-two billion, two hundred thirty-two million, one hundred one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •