Base | Representation |
---|---|
bin | 1001100010100101… |
… | …11011110011010111 |
3 | 111012221222021212220 |
4 | 10301102323303113 |
5 | 40442213430143 |
6 | 2204130313423 |
7 | 240633255441 |
oct | 46122736327 |
9 | 14187867786 |
10 | 5122014423 |
11 | 2199275279 |
12 | bab428873 |
13 | 63820c686 |
14 | 368383491 |
15 | 1eea08d83 |
hex | 1314bbcd7 |
5122014423 has 8 divisors (see below), whose sum is σ = 7064847600. Its totient is φ = 3296928768.
The previous prime is 5122014409. The next prime is 5122014427. The reversal of 5122014423 is 3244102215.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5122014423 - 210 = 5122013399 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5122014393 and 5122014402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5122014427) 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, 29436778 + ... + 29436951.
It is an arithmetic number, because the mean of its divisors is an integer number (883105950).
Almost surely, 25122014423 is an apocalyptic number.
5122014423 is a deficient number, since it is larger than the sum of its proper divisors (1942833177).
5122014423 is a wasteful number, since it uses less digits than its factorization.
5122014423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58873761.
The product of its (nonzero) digits is 1920, while the sum is 24.
The square root of 5122014423 is about 71568.2501043584. The cubic root of 5122014423 is about 1723.7737610747.
Adding to 5122014423 its reverse (3244102215), we get a palindrome (8366116638).
The spelling of 5122014423 in words is "five billion, one hundred twenty-two million, fourteen thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •