Base | Representation |
---|---|
bin | 1011000000100000010110… |
… | …0111111101010101111001 |
3 | 1120212001202122012200202021 |
4 | 2300020011213331111321 |
5 | 3041300040410413311 |
6 | 41424103533034441 |
7 | 2356302234150643 |
oct | 260100547752571 |
9 | 46761678180667 |
10 | 12103312201081 |
11 | 3946a93228672 |
12 | 1435852925a21 |
13 | 69a45049400a |
14 | 2dbb368b3893 |
15 | 15ec7cd1d171 |
hex | b02059fd579 |
12103312201081 has 2 divisors, whose sum is σ = 12103312201082. Its totient is φ = 12103312201080.
The previous prime is 12103312201033. The next prime is 12103312201151. The reversal of 12103312201081 is 18010221330121.
12103312201081 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., 9040605697600 + 3062706503481 = 3006760^2 + 1750059^2 .
It is a cyclic number.
It is not a de Polignac number, because 12103312201081 - 237 = 11965873247609 is a prime.
It is a super-2 number, since 2×121033122010812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (12103312501081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6051656100540 + 6051656100541.
It is an arithmetic number, because the mean of its divisors is an integer number (6051656100541).
Almost surely, 212103312201081 is an apocalyptic number.
It is an amenable number.
12103312201081 is a deficient number, since it is larger than the sum of its proper divisors (1).
12103312201081 is an equidigital number, since it uses as much as digits as its factorization.
12103312201081 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 576, while the sum is 25.
The spelling of 12103312201081 in words is "twelve trillion, one hundred three billion, three hundred twelve million, two hundred one thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.160 sec. • engine limits •