Base | Representation |
---|---|
bin | 100110101001001100000… |
… | …1101000010010011110111 |
3 | 200210201221222222212012101 |
4 | 1031102120031002103313 |
5 | 1144004200040211043 |
6 | 15143522331202531 |
7 | 1055500554514405 |
oct | 115223015022367 |
9 | 20721858885171 |
10 | 5311133132023 |
11 | 1768491212714 |
12 | 7193bb8a6447 |
13 | 2c6ab7591754 |
14 | 1450bb332475 |
15 | 9324c4bb24d |
hex | 4d4983424f7 |
5311133132023 has 4 divisors (see below), whose sum is σ = 5311139630040. Its totient is φ = 5311126634008.
The previous prime is 5311133131951. The next prime is 5311133132077. The reversal of 5311133132023 is 3202313311135.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 5311133132023 - 29 = 5311133131511 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5311133131982 and 5311133132000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5311133132083) 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, 1810765 + ... + 3728422.
It is an arithmetic number, because the mean of its divisors is an integer number (1327784907510).
Almost surely, 25311133132023 is an apocalyptic number.
5311133132023 is a deficient number, since it is larger than the sum of its proper divisors (6498017).
5311133132023 is an equidigital number, since it uses as much as digits as its factorization.
5311133132023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6498016.
The product of its (nonzero) digits is 4860, while the sum is 28.
Adding to 5311133132023 its reverse (3202313311135), we get a palindrome (8513446443158).
The spelling of 5311133132023 in words is "five trillion, three hundred eleven billion, one hundred thirty-three million, one hundred thirty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •