Base | Representation |
---|---|
bin | 100100101101110… |
… | …0001000011100101 |
3 | 10011212010112202202 |
4 | 1021123201003211 |
5 | 10010334400203 |
6 | 322124544245 |
7 | 42346255055 |
oct | 11133410345 |
9 | 3155115682 |
10 | 1231950053 |
11 | 582449344 |
12 | 2a46b2085 |
13 | 1682ccc39 |
14 | b9889565 |
15 | 7324c388 |
hex | 496e10e5 |
1231950053 has 2 divisors, whose sum is σ = 1231950054. Its totient is φ = 1231950052.
The previous prime is 1231950047. The next prime is 1231950059. The reversal of 1231950053 is 3500591321.
It is a balanced prime because it is at equal distance from previous prime (1231950047) and next prime (1231950059).
It can be written as a sum of positive squares in only one way, i.e., 1137510529 + 94439524 = 33727^2 + 9718^2 .
It is an emirp because it is prime and its reverse (3500591321) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1231950053 - 24 = 1231950037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1231949998 and 1231950025.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1231950059) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 615975026 + 615975027.
It is an arithmetic number, because the mean of its divisors is an integer number (615975027).
Almost surely, 21231950053 is an apocalyptic number.
It is an amenable number.
1231950053 is a deficient number, since it is larger than the sum of its proper divisors (1).
1231950053 is an equidigital number, since it uses as much as digits as its factorization.
1231950053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4050, while the sum is 29.
The square root of 1231950053 is about 35099.1460437430. The cubic root of 1231950053 is about 1072.0071949121.
The spelling of 1231950053 in words is "one billion, two hundred thirty-one million, nine hundred fifty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •