Base | Representation |
---|---|
bin | 10000001101111001011… |
… | …000111010001010010011 |
3 | 10221112112202111100012222 |
4 | 100031321120322022103 |
5 | 121224324333234413 |
6 | 2211544041011255 |
7 | 143341456034351 |
oct | 20157130721223 |
9 | 3845482440188 |
10 | 1114433102483 |
11 | 39a6a0484568 |
12 | 15bb99483b2b |
13 | 811240488bc |
14 | 3bd202c07d1 |
15 | 1dec7b35b08 |
hex | 1037963a293 |
1114433102483 has 2 divisors, whose sum is σ = 1114433102484. Its totient is φ = 1114433102482.
The previous prime is 1114433102407. The next prime is 1114433102491. The reversal of 1114433102483 is 3842013344111.
It is a strong prime.
It is an emirp because it is prime and its reverse (3842013344111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1114433102483 - 238 = 839555195539 is a prime.
It is a super-2 number, since 2×11144331024832 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1114433102183) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 557216551241 + 557216551242.
It is an arithmetic number, because the mean of its divisors is an integer number (557216551242).
Almost surely, 21114433102483 is an apocalyptic number.
1114433102483 is a deficient number, since it is larger than the sum of its proper divisors (1).
1114433102483 is an equidigital number, since it uses as much as digits as its factorization.
1114433102483 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27648, while the sum is 35.
Adding to 1114433102483 its reverse (3842013344111), we get a palindrome (4956446446594).
The spelling of 1114433102483 in words is "one trillion, one hundred fourteen billion, four hundred thirty-three million, one hundred two thousand, four hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •