Base | Representation |
---|---|
bin | 100010000001001… |
… | …0011000011100111 |
3 | 2221112211211012012 |
4 | 1010002103003213 |
5 | 4314202444111 |
6 | 305133144435 |
7 | 40200122255 |
oct | 10402230347 |
9 | 2845754165 |
10 | 1141453031 |
11 | 536358614 |
12 | 27a32b11b |
13 | 1526359c4 |
14 | ab84d5d5 |
15 | 6a32348b |
hex | 440930e7 |
1141453031 has 2 divisors, whose sum is σ = 1141453032. Its totient is φ = 1141453030.
The previous prime is 1141453009. The next prime is 1141453043. The reversal of 1141453031 is 1303541411.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (1303541411) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1141453031 - 210 = 1141452007 is a prime.
It is a super-2 number, since 2×11414530312 = 2605830043958173922, which contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 1141452988 and 1141453006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1141453081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 570726515 + 570726516.
It is an arithmetic number, because the mean of its divisors is an integer number (570726516).
Almost surely, 21141453031 is an apocalyptic number.
1141453031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1141453031 is an equidigital number, since it uses as much as digits as its factorization.
1141453031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 720, while the sum is 23.
The square root of 1141453031 is about 33785.3967121891. The cubic root of 1141453031 is about 1045.0875688008.
Adding to 1141453031 its reverse (1303541411), we get a palindrome (2444994442).
The spelling of 1141453031 in words is "one billion, one hundred forty-one million, four hundred fifty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •