Base | Representation |
---|---|
bin | 100010011000000000100… |
… | …1001010101000000011101 |
3 | 121201122201100201222012212 |
4 | 1010300001021111000131 |
5 | 1104401220202420112 |
6 | 14014221520210205 |
7 | 665222046003641 |
oct | 104600111250035 |
9 | 17648640658185 |
10 | 4724483248157 |
11 | 1561707698a52 |
12 | 643777a69965 |
13 | 2836946ccc5a |
14 | 124948114c21 |
15 | 82d646ad522 |
hex | 44c0125501d |
4724483248157 has 2 divisors, whose sum is σ = 4724483248158. Its totient is φ = 4724483248156.
The previous prime is 4724483248103. The next prime is 4724483248183. The reversal of 4724483248157 is 7518423844274.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3520955769241 + 1203527478916 = 1876421^2 + 1097054^2 .
It is a cyclic number.
It is not a de Polignac number, because 4724483248157 - 28 = 4724483247901 is a prime.
It is a super-2 number, since 2×47244832481572 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4724483248096 and 4724483248105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4724483248757) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2362241624078 + 2362241624079.
It is an arithmetic number, because the mean of its divisors is an integer number (2362241624079).
Almost surely, 24724483248157 is an apocalyptic number.
It is an amenable number.
4724483248157 is a deficient number, since it is larger than the sum of its proper divisors (1).
4724483248157 is an equidigital number, since it uses as much as digits as its factorization.
4724483248157 is an evil number, because the sum of its binary digits is even.
The product of its digits is 48168960, while the sum is 59.
The spelling of 4724483248157 in words is "four trillion, seven hundred twenty-four billion, four hundred eighty-three million, two hundred forty-eight thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •