Base | Representation |
---|---|
bin | 1001100011101101… |
… | …10110111000100101 |
3 | 111020121200201122002 |
4 | 10301312312320211 |
5 | 41002121301321 |
6 | 2205104215045 |
7 | 241106306402 |
oct | 46166667045 |
9 | 14217621562 |
10 | 5131431461 |
11 | 21a3617452 |
12 | bb260a485 |
13 | 63a158aa0 |
14 | 3697152a9 |
15 | 20076920b |
hex | 131db6e25 |
5131431461 has 8 divisors (see below), whose sum is σ = 5527624704. Its totient is φ = 4735447920.
The previous prime is 5131431427. The next prime is 5131431467. The reversal of 5131431461 is 1641341315.
5131431461 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 5131431461 - 26 = 5131431397 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5131431467) 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, 380 + ... + 101306.
It is an arithmetic number, because the mean of its divisors is an integer number (690953088).
Almost surely, 25131431461 is an apocalyptic number.
It is an amenable number.
5131431461 is a deficient number, since it is larger than the sum of its proper divisors (396193243).
5131431461 is a wasteful number, since it uses less digits than its factorization.
5131431461 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 104851.
The product of its digits is 4320, while the sum is 29.
The square root of 5131431461 is about 71634.0105047875. The cubic root of 5131431461 is about 1724.8295243979.
Adding to 5131431461 its reverse (1641341315), we get a palindrome (6772772776).
The spelling of 5131431461 in words is "five billion, one hundred thirty-one million, four hundred thirty-one thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •