Base | Representation |
---|---|
bin | 1001001101110010010100… |
… | …0101011001101001100001 |
3 | 1022212122121212022121121001 |
4 | 2103130211011121221201 |
5 | 2312002224201232113 |
6 | 33314441104432001 |
7 | 2064021362103001 |
oct | 223344505315141 |
9 | 38778555277531 |
10 | 10132450024033 |
11 | 32571699824a7 |
12 | 11778a1018601 |
13 | 5866417b1ccc |
14 | 2705adb5a001 |
15 | 12887ce0e7dd |
hex | 93725159a61 |
10132450024033 has 2 divisors, whose sum is σ = 10132450024034. Its totient is φ = 10132450024032.
The previous prime is 10132450024003. The next prime is 10132450024111. The reversal of 10132450024033 is 33042005423101.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9019492543009 + 1112957481024 = 3003247^2 + 1054968^2 .
It is a cyclic number.
It is not a de Polignac number, because 10132450024033 - 229 = 10131913153121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10132450023992 and 10132450024010.
It is not a weakly prime, because it can be changed into another prime (10132450024003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5066225012016 + 5066225012017.
It is an arithmetic number, because the mean of its divisors is an integer number (5066225012017).
Almost surely, 210132450024033 is an apocalyptic number.
It is an amenable number.
10132450024033 is a deficient number, since it is larger than the sum of its proper divisors (1).
10132450024033 is an equidigital number, since it uses as much as digits as its factorization.
10132450024033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8640, while the sum is 28.
Adding to 10132450024033 its reverse (33042005423101), we get a palindrome (43174455447134).
The spelling of 10132450024033 in words is "ten trillion, one hundred thirty-two billion, four hundred fifty million, twenty-four thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •