Base | Representation |
---|---|
bin | 1001010110110100… |
… | …11010110011100001 |
3 | 110222002020202011010 |
4 | 10223122122303201 |
5 | 40241432004441 |
6 | 2150243011133 |
7 | 235324312521 |
oct | 45332326341 |
9 | 13862222133 |
10 | 5023313121 |
11 | 2148590552 |
12 | b82369aa9 |
13 | 620932038 |
14 | 35920d681 |
15 | 1e600e116 |
hex | 12b69ace1 |
5023313121 has 8 divisors (see below), whose sum is σ = 6698815200. Its totient is φ = 3348343232.
The previous prime is 5023313063. The next prime is 5023313131. The reversal of 5023313121 is 1213133205.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5023313121 - 27 = 5023312993 is a prime.
It is a super-2 number, since 2×50233131212 = 50467349423221521282, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5023313131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 110475 + ... + 149168.
It is an arithmetic number, because the mean of its divisors is an integer number (837351900).
Almost surely, 25023313121 is an apocalyptic number.
It is an amenable number.
5023313121 is a deficient number, since it is larger than the sum of its proper divisors (1675502079).
5023313121 is a wasteful number, since it uses less digits than its factorization.
5023313121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 266095.
The product of its (nonzero) digits is 540, while the sum is 21.
The square root of 5023313121 is about 70875.3350679910. The cubic root of 5023313121 is about 1712.6294851991.
Adding to 5023313121 its reverse (1213133205), we get a palindrome (6236446326).
The spelling of 5023313121 in words is "five billion, twenty-three million, three hundred thirteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •