Base | Representation |
---|---|
bin | 100110001110101100000… |
… | …1111011010110111100111 |
3 | 200121022002000010120211210 |
4 | 1030131120033122313213 |
5 | 1142041123203041411 |
6 | 15101431410002503 |
7 | 1051414414230465 |
oct | 114353017326747 |
9 | 20538060116753 |
10 | 5254225440231 |
11 | 1746339313579 |
12 | 70a379576433 |
13 | 2c1618698541 |
14 | 14243d433835 |
15 | 91a1b492ca6 |
hex | 4c7583dade7 |
5254225440231 has 4 divisors (see below), whose sum is σ = 7005633920312. Its totient is φ = 3502816960152.
The previous prime is 5254225440199. The next prime is 5254225440239. The reversal of 5254225440231 is 1320445224525.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 5254225440231 - 25 = 5254225440199 is a prime.
It is a super-2 number, since 2×52542254402312 (a number of 26 digits) 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 5254225440231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5254225440239) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 875704240036 + ... + 875704240041.
It is an arithmetic number, because the mean of its divisors is an integer number (1751408480078).
Almost surely, 25254225440231 is an apocalyptic number.
5254225440231 is a deficient number, since it is larger than the sum of its proper divisors (1751408480081).
5254225440231 is a wasteful number, since it uses less digits than its factorization.
5254225440231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1751408480080.
The product of its (nonzero) digits is 384000, while the sum is 39.
The spelling of 5254225440231 in words is "five trillion, two hundred fifty-four billion, two hundred twenty-five million, four hundred forty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •