Base | Representation |
---|---|
bin | 1001100101011101… |
… | …00101111101110111 |
3 | 111021122012000211201 |
4 | 10302232211331313 |
5 | 41014341322411 |
6 | 2210345313331 |
7 | 241344431401 |
oct | 46256457567 |
9 | 14248160751 |
10 | 5146042231 |
11 | 2200896770 |
12 | bb7495847 |
13 | 6401a3205 |
14 | 36b639b71 |
15 | 201ba33c1 |
hex | 132ba5f77 |
5146042231 has 8 divisors (see below), whose sum is σ = 5628009744. Its totient is φ = 4666432320.
The previous prime is 5146042229. The next prime is 5146042249. The reversal of 5146042231 is 1322406415.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5146042231 - 21 = 5146042229 is a prime.
It is a super-2 number, since 2×51460422312 = 52963501286470914722, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5146042231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5146042201) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 584830 + ... + 593563.
It is an arithmetic number, because the mean of its divisors is an integer number (703501218).
Almost surely, 25146042231 is an apocalyptic number.
5146042231 is a deficient number, since it is larger than the sum of its proper divisors (481967513).
5146042231 is a wasteful number, since it uses less digits than its factorization.
5146042231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1178801.
The product of its (nonzero) digits is 5760, while the sum is 28.
The square root of 5146042231 is about 71735.9200888927. The cubic root of 5146042231 is about 1726.4650138969.
Adding to 5146042231 its reverse (1322406415), we get a palindrome (6468448646).
The spelling of 5146042231 in words is "five billion, one hundred forty-six million, forty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •