Base | Representation |
---|---|
bin | 10000011110101010001… |
… | …011100010011100101101 |
3 | 11000021000002202012222122 |
4 | 100132222023202130231 |
5 | 122023204434102003 |
6 | 2224122030122325 |
7 | 144546465233123 |
oct | 20365213423455 |
9 | 4007002665878 |
10 | 1132431550253 |
11 | 3a72970a6793 |
12 | 1635810503a5 |
13 | 82a31b547b3 |
14 | 3cb4a825913 |
15 | 1e6cccd4238 |
hex | 107aa2e272d |
1132431550253 has 4 divisors (see below), whose sum is σ = 1133870472960. Its totient is φ = 1130992627548.
The previous prime is 1132431550207. The next prime is 1132431550309. The reversal of 1132431550253 is 3520551342311.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1132431550253 - 26 = 1132431550189 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1132431550553) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 719460173 + ... + 719461746.
It is an arithmetic number, because the mean of its divisors is an integer number (283467618240).
Almost surely, 21132431550253 is an apocalyptic number.
It is an amenable number.
1132431550253 is a deficient number, since it is larger than the sum of its proper divisors (1438922707).
1132431550253 is an equidigital number, since it uses as much as digits as its factorization.
1132431550253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1438922706.
The product of its (nonzero) digits is 54000, while the sum is 35.
Adding to 1132431550253 its reverse (3520551342311), we get a palindrome (4652982892564).
The spelling of 1132431550253 in words is "one trillion, one hundred thirty-two billion, four hundred thirty-one million, five hundred fifty thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •