Base | Representation |
---|---|
bin | 1001100001110010… |
… | …11010011100111111 |
3 | 111012111101101122201 |
4 | 10300321122130333 |
5 | 40434010333343 |
6 | 2203331052331 |
7 | 240522352462 |
oct | 46071323477 |
9 | 14174341581 |
10 | 5115324223 |
11 | 2195515889 |
12 | ba91410a7 |
13 | 636a09489 |
14 | 3675212d9 |
15 | 1ee13694d |
hex | 130e5a73f |
5115324223 has 4 divisors (see below), whose sum is σ = 5337729648. Its totient is φ = 4892918800.
The previous prime is 5115324211. The next prime is 5115324271. The reversal of 5115324223 is 3224235115.
It is a semiprime because it is the product of two primes.
It is a de Polignac number, because none of the positive numbers 2k-5115324223 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5115324191 and 5115324200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5115324623) 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 3 ways as a sum of consecutive naturals, for example, 111202678 + ... + 111202723.
It is an arithmetic number, because the mean of its divisors is an integer number (1334432412).
Almost surely, 25115324223 is an apocalyptic number.
5115324223 is a deficient number, since it is larger than the sum of its proper divisors (222405425).
5115324223 is a wasteful number, since it uses less digits than its factorization.
5115324223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 222405424.
The product of its digits is 7200, while the sum is 28.
The square root of 5115324223 is about 71521.4948319734. The cubic root of 5115324223 is about 1723.0229226361.
Adding to 5115324223 its reverse (3224235115), we get a palindrome (8339559338).
The spelling of 5115324223 in words is "five billion, one hundred fifteen million, three hundred twenty-four thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •