Base | Representation |
---|---|
bin | 10000100000100111010… |
… | …101100010110001110011 |
3 | 11000110102102211211111022 |
4 | 100200213111202301303 |
5 | 122042010004400133 |
6 | 2225110235410055 |
7 | 144652513101404 |
oct | 20404725426163 |
9 | 4013372754438 |
10 | 1134531325043 |
11 | 3a81743a0656 |
12 | 163a682b392b |
13 | 82ca7b93c9c |
14 | 3cca96539ab |
15 | 1e7a2304998 |
hex | 10827562c73 |
1134531325043 has 2 divisors, whose sum is σ = 1134531325044. Its totient is φ = 1134531325042.
The previous prime is 1134531325003. The next prime is 1134531325063. The reversal of 1134531325043 is 3405231354311.
It is a strong prime.
It is an emirp because it is prime and its reverse (3405231354311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1134531325043 - 212 = 1134531320947 is a prime.
It is a super-2 number, since 2×11345313250432 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1134531324994 and 1134531325012.
It is not a weakly prime, because it can be changed into another prime (1134531325003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 567265662521 + 567265662522.
It is an arithmetic number, because the mean of its divisors is an integer number (567265662522).
Almost surely, 21134531325043 is an apocalyptic number.
1134531325043 is a deficient number, since it is larger than the sum of its proper divisors (1).
1134531325043 is an equidigital number, since it uses as much as digits as its factorization.
1134531325043 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64800, while the sum is 35.
Adding to 1134531325043 its reverse (3405231354311), we get a palindrome (4539762679354).
The spelling of 1134531325043 in words is "one trillion, one hundred thirty-four billion, five hundred thirty-one million, three hundred twenty-five thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •