Base | Representation |
---|---|
bin | 100101000110111111000… |
… | …0001001111010000111001 |
3 | 200001120121112011210102111 |
4 | 1022031332001033100321 |
5 | 1132030243022343413 |
6 | 14503003524532321 |
7 | 1034323466252110 |
oct | 112157601172071 |
9 | 20046545153374 |
10 | 5100240434233 |
11 | 1696aaa84243a |
12 | 6a45642510a1 |
13 | 2acc48647389 |
14 | 138bd2712c77 |
15 | 8ca07b00d3d |
hex | 4a37e04f439 |
5100240434233 has 8 divisors (see below), whose sum is σ = 5830193332352. Its totient is φ = 4370624316576.
The previous prime is 5100240434153. The next prime is 5100240434243. The reversal of 5100240434233 is 3324340420015.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-5100240434233 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5100240434195 and 5100240434204.
It is not an unprimeable number, because it can be changed into a prime (5100240434243) 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, 84162660 + ... + 84223237.
It is an arithmetic number, because the mean of its divisors is an integer number (728774166544).
Almost surely, 25100240434233 is an apocalyptic number.
It is an amenable number.
5100240434233 is a deficient number, since it is larger than the sum of its proper divisors (729952898119).
5100240434233 is a wasteful number, since it uses less digits than its factorization.
5100240434233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 168390231.
The product of its (nonzero) digits is 34560, while the sum is 31.
Adding to 5100240434233 its reverse (3324340420015), we get a palindrome (8424580854248).
The spelling of 5100240434233 in words is "five trillion, one hundred billion, two hundred forty million, four hundred thirty-four thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •