Base | Representation |
---|---|
bin | 10000011111001100001… |
… | …100000001100011111001 |
3 | 11000022110212100022021002 |
4 | 100133030030001203321 |
5 | 122030342014244113 |
6 | 2224254411054345 |
7 | 144566563655243 |
oct | 20371414014371 |
9 | 4008425308232 |
10 | 1133002103033 |
11 | 3a755a171509 |
12 | 1637001413b5 |
13 | 82ac310cba8 |
14 | 3cba2505093 |
15 | 1e712e36c58 |
hex | 107cc3018f9 |
1133002103033 has 2 divisors, whose sum is σ = 1133002103034. Its totient is φ = 1133002103032.
The previous prime is 1133002103021. The next prime is 1133002103039. The reversal of 1133002103033 is 3303012003311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1072152560704 + 60849542329 = 1035448^2 + 246677^2 .
It is an emirp because it is prime and its reverse (3303012003311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1133002103033 - 24 = 1133002103017 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1133002102996 and 1133002103014.
It is not a weakly prime, because it can be changed into another prime (1133002103039) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 566501051516 + 566501051517.
It is an arithmetic number, because the mean of its divisors is an integer number (566501051517).
Almost surely, 21133002103033 is an apocalyptic number.
It is an amenable number.
1133002103033 is a deficient number, since it is larger than the sum of its proper divisors (1).
1133002103033 is an equidigital number, since it uses as much as digits as its factorization.
1133002103033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 1133002103033 its reverse (3303012003311), we get a palindrome (4436014106344).
The spelling of 1133002103033 in words is "one trillion, one hundred thirty-three billion, two million, one hundred three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •