Base | Representation |
---|---|
bin | 100110010100011101100… |
… | …1001011101011010011101 |
3 | 200122111001221220021201021 |
4 | 1030220323021131122131 |
5 | 1142242020243143123 |
6 | 15111241452244141 |
7 | 1052333544261202 |
oct | 114507311353235 |
9 | 20574057807637 |
10 | 5266622240413 |
11 | 175061aa54a86 |
12 | 710859170651 |
13 | 2c2842ac1071 |
14 | 142c97a21ca9 |
15 | 91ee4993c5d |
hex | 4ca3b25d69d |
5266622240413 has 8 divisors (see below), whose sum is σ = 5274587819232. Its totient is φ = 5258660521296.
The previous prime is 5266622240393. The next prime is 5266622240417. The reversal of 5266622240413 is 3140422266625.
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 5266622240413 - 233 = 5258032305821 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5266622240413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5266622240417) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1772031 + ... + 3697747.
It is an arithmetic number, because the mean of its divisors is an integer number (659323477404).
Almost surely, 25266622240413 is an apocalyptic number.
It is an amenable number.
5266622240413 is a deficient number, since it is larger than the sum of its proper divisors (7965578819).
5266622240413 is a wasteful number, since it uses less digits than its factorization.
5266622240413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1929851.
The product of its (nonzero) digits is 829440, while the sum is 43.
The spelling of 5266622240413 in words is "five trillion, two hundred sixty-six billion, six hundred twenty-two million, two hundred forty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •