Base | Representation |
---|---|
bin | 1011000000011111010100… |
… | …0000000010010010100101 |
3 | 1120212001001012102001120112 |
4 | 2300013311000002102211 |
5 | 3041244003011101013 |
6 | 41424020131142405 |
7 | 2356262306425436 |
oct | 260076500022245 |
9 | 46761035361515 |
10 | 12103033300133 |
11 | 394695a855216 |
12 | 1435795444a05 |
13 | 69a407772979 |
14 | 2dbb0b83348d |
15 | 15ec635caba8 |
hex | b01f50024a5 |
12103033300133 has 2 divisors, whose sum is σ = 12103033300134. Its totient is φ = 12103033300132.
The previous prime is 12103033300097. The next prime is 12103033300153. The reversal of 12103033300133 is 33100333030121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7198478268004 + 4904555032129 = 2682998^2 + 2214623^2 .
It is a cyclic number.
It is not a de Polignac number, because 12103033300133 - 238 = 11828155393189 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12103033300099 and 12103033300108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12103033300153) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6051516650066 + 6051516650067.
It is an arithmetic number, because the mean of its divisors is an integer number (6051516650067).
Almost surely, 212103033300133 is an apocalyptic number.
It is an amenable number.
12103033300133 is a deficient number, since it is larger than the sum of its proper divisors (1).
12103033300133 is an equidigital number, since it uses as much as digits as its factorization.
12103033300133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1458, while the sum is 23.
Adding to 12103033300133 its reverse (33100333030121), we get a palindrome (45203366330254).
The spelling of 12103033300133 in words is "twelve trillion, one hundred three billion, thirty-three million, three hundred thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •