Base | Representation |
---|---|
bin | 1110001101100010101… |
… | …0010010010000000001 |
3 | 212100012110012012002211 |
4 | 3203120222102100001 |
5 | 13000011200211113 |
6 | 304055024542121 |
7 | 23432225244316 |
oct | 3433052222001 |
9 | 770173165084 |
10 | 244153132033 |
11 | 945aa094868 |
12 | 3b39a481941 |
13 | 1a03c94a7c5 |
14 | bb620a4d0d |
15 | 653e87db3d |
hex | 38d8a92401 |
244153132033 has 2 divisors, whose sum is σ = 244153132034. Its totient is φ = 244153132032.
The previous prime is 244153132001. The next prime is 244153132037. The reversal of 244153132033 is 330231351442.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 132268233969 + 111884898064 = 363687^2 + 334492^2 .
It is a cyclic number.
It is not a de Polignac number, because 244153132033 - 25 = 244153132001 is a prime.
It is a super-2 number, since 2×2441531320332 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 244153131986 and 244153132004.
It is not a weakly prime, because it can be changed into another prime (244153132037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 122076566016 + 122076566017.
It is an arithmetic number, because the mean of its divisors is an integer number (122076566017).
Almost surely, 2244153132033 is an apocalyptic number.
It is an amenable number.
244153132033 is a deficient number, since it is larger than the sum of its proper divisors (1).
244153132033 is an equidigital number, since it uses as much as digits as its factorization.
244153132033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 25920, while the sum is 31.
Adding to 244153132033 its reverse (330231351442), we get a palindrome (574384483475).
The spelling of 244153132033 in words is "two hundred forty-four billion, one hundred fifty-three million, one hundred thirty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •