Base | Representation |
---|---|
bin | 1001100000101000… |
… | …00001001100001011 |
3 | 111011210221100201220 |
4 | 10300110001030023 |
5 | 40424003141134 |
6 | 2202341013123 |
7 | 240343134045 |
oct | 46024011413 |
9 | 14153840656 |
10 | 5105521419 |
11 | 218aa2a899 |
12 | ba59b41a3 |
13 | 6349865bb |
14 | 3660cca95 |
15 | 1ed34c149 |
hex | 13050130b |
5105521419 has 4 divisors (see below), whose sum is σ = 6807361896. Its totient is φ = 3403680944.
The previous prime is 5105521411. The next prime is 5105521423. The reversal of 5105521419 is 9141255015.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 5105521419 - 23 = 5105521411 is a prime.
It is a super-2 number, since 2×51055214192 = 52132697919735547122, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5105521419.
It is not an unprimeable number, because it can be changed into a prime (5105521411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 850920234 + ... + 850920239.
It is an arithmetic number, because the mean of its divisors is an integer number (1701840474).
Almost surely, 25105521419 is an apocalyptic number.
5105521419 is a deficient number, since it is larger than the sum of its proper divisors (1701840477).
5105521419 is a wasteful number, since it uses less digits than its factorization.
5105521419 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1701840476.
The product of its (nonzero) digits is 9000, while the sum is 33.
The square root of 5105521419 is about 71452.9314933964. The cubic root of 5105521419 is about 1721.9215745976.
The spelling of 5105521419 in words is "five billion, one hundred five million, five hundred twenty-one thousand, four hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •