Base | Representation |
---|---|
bin | 1001011001100110… |
… | …10101010000101111 |
3 | 111000201002220212110 |
4 | 10230303111100233 |
5 | 40313413334411 |
6 | 2152434335103 |
7 | 236026400301 |
oct | 45463252057 |
9 | 14021086773 |
10 | 5046621231 |
11 | 215a760253 |
12 | b8a12a493 |
13 | 625703112 |
14 | 35c359971 |
15 | 1e80b52a6 |
hex | 12ccd542f |
5046621231 has 8 divisors (see below), whose sum is σ = 6798198064. Its totient is φ = 3329729280.
The previous prime is 5046621211. The next prime is 5046621289. The reversal of 5046621231 is 1321266405.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5046621231 - 210 = 5046620207 is a prime.
It is a super-2 number, since 2×50466212312 = 50936771698359910722, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5046621211) 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, 8670880 + ... + 8671461.
It is an arithmetic number, because the mean of its divisors is an integer number (849774758).
Almost surely, 25046621231 is an apocalyptic number.
5046621231 is a deficient number, since it is larger than the sum of its proper divisors (1751576833).
5046621231 is a wasteful number, since it uses less digits than its factorization.
5046621231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17342441.
The product of its (nonzero) digits is 8640, while the sum is 30.
The square root of 5046621231 is about 71039.5751043037. The cubic root of 5046621231 is about 1715.2742586262.
Adding to 5046621231 its reverse (1321266405), we get a palindrome (6367887636).
The spelling of 5046621231 in words is "five billion, forty-six million, six hundred twenty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •