Base | Representation |
---|---|
bin | 100101010001101100010… |
… | …0100101110110100010001 |
3 | 200010202222000121121021212 |
4 | 1022203120210232310101 |
5 | 1132414341014240213 |
6 | 14521325332025505 |
7 | 1036066345636004 |
oct | 112433044566421 |
9 | 20122860547255 |
10 | 5123234524433 |
11 | 16a582a365773 |
12 | 6a8b00a62295 |
13 | 2b21714175cc |
14 | 139d7450353b |
15 | 8d4016449a8 |
hex | 4a8d892ed11 |
5123234524433 has 8 divisors (see below), whose sum is σ = 5128794404640. Its totient is φ = 5117674962400.
The previous prime is 5123234524367. The next prime is 5123234524523. The reversal of 5123234524433 is 3344254323215.
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 5123234524433 - 210 = 5123234523409 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5123234524333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 47344253 + ... + 47452341.
It is an arithmetic number, because the mean of its divisors is an integer number (641099300580).
Almost surely, 25123234524433 is an apocalyptic number.
It is an amenable number.
5123234524433 is a deficient number, since it is larger than the sum of its proper divisors (5559880207).
5123234524433 is a wasteful number, since it uses less digits than its factorization.
5123234524433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 159087.
The product of its digits is 1036800, while the sum is 41.
Adding to 5123234524433 its reverse (3344254323215), we get a palindrome (8467488847648).
The spelling of 5123234524433 in words is "five trillion, one hundred twenty-three billion, two hundred thirty-four million, five hundred twenty-four thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •