Base | Representation |
---|---|
bin | 1001001101110100101111… |
… | …1100111111111100110001 |
3 | 1022212201022022101011222112 |
4 | 2103131023330333330301 |
5 | 2312010043121224131 |
6 | 33315025521415105 |
7 | 2064043500662306 |
oct | 223351374777461 |
9 | 38781268334875 |
10 | 10133102133041 |
11 | 3257473a91668 |
12 | 1177a4349a495 |
13 | 586716923c24 |
14 | 2706325c90ad |
15 | 1288ba2c202b |
hex | 9374bf3ff31 |
10133102133041 has 2 divisors, whose sum is σ = 10133102133042. Its totient is φ = 10133102133040.
The previous prime is 10133102132969. The next prime is 10133102133047. The reversal of 10133102133041 is 14033120133101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9138504816016 + 994597317025 = 3022996^2 + 997295^2 .
It is a cyclic number.
It is not a de Polignac number, because 10133102133041 - 222 = 10133097938737 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10133102132998 and 10133102133016.
It is not a weakly prime, because it can be changed into another prime (10133102133047) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5066551066520 + 5066551066521.
It is an arithmetic number, because the mean of its divisors is an integer number (5066551066521).
Almost surely, 210133102133041 is an apocalyptic number.
It is an amenable number.
10133102133041 is a deficient number, since it is larger than the sum of its proper divisors (1).
10133102133041 is an equidigital number, since it uses as much as digits as its factorization.
10133102133041 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 10133102133041 its reverse (14033120133101), we get a palindrome (24166222266142).
The spelling of 10133102133041 in words is "ten trillion, one hundred thirty-three billion, one hundred two million, one hundred thirty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •