Base | Representation |
---|---|
bin | 1001011011010101… |
… | …01001010100101011 |
3 | 111001201101121020220 |
4 | 10231222221110223 |
5 | 40331121340243 |
6 | 2154113221123 |
7 | 236263551516 |
oct | 45552512453 |
9 | 14051347226 |
10 | 5061121323 |
11 | 21679643a5 |
12 | b92b617a3 |
13 | 62870c05b |
14 | 360251d7d |
15 | 1e94cb783 |
hex | 12daa952b |
5061121323 has 16 divisors (see below), whose sum is σ = 7201382400. Its totient is φ = 3150596736.
The previous prime is 5061121309. The next prime is 5061121363. The reversal of 5061121323 is 3231211605.
It is not a de Polignac number, because 5061121323 - 216 = 5061055787 is a prime.
It is a super-2 number, since 2×50611213232 = 51229898092250540658, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5061121293 and 5061121302.
It is not an unprimeable number, because it can be changed into a prime (5061121363) 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 15 ways as a sum of consecutive naturals, for example, 384223 + ... + 397176.
It is an arithmetic number, because the mean of its divisors is an integer number (450086400).
Almost surely, 25061121323 is an apocalyptic number.
5061121323 is a deficient number, since it is larger than the sum of its proper divisors (2140261077).
5061121323 is a wasteful number, since it uses less digits than its factorization.
5061121323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 781546.
The product of its (nonzero) digits is 1080, while the sum is 24.
The square root of 5061121323 is about 71141.5583396934. The cubic root of 5061121323 is about 1716.9154789428.
Adding to 5061121323 its reverse (3231211605), we get a palindrome (8292332928).
The spelling of 5061121323 in words is "five billion, sixty-one million, one hundred twenty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •