Base | Representation |
---|---|
bin | 1001100100010100001101… |
… | …0001000011001001000001 |
3 | 1101020122200021121220201102 |
4 | 2121011003101003021001 |
5 | 2334322420340410224 |
6 | 34212332042544145 |
7 | 2134003046665142 |
oct | 231050321031101 |
9 | 41218607556642 |
10 | 10519503450689 |
11 | 3396329500702 |
12 | 121a900508055 |
13 | 5b3ca5b3665c |
14 | 28520a6ddac9 |
15 | 133982e0b4ae |
hex | 99143443241 |
10519503450689 has 4 divisors (see below), whose sum is σ = 10621634552256. Its totient is φ = 10417372349124.
The previous prime is 10519503450679. The next prime is 10519503450749. The reversal of 10519503450689 is 98605430591501.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10519503450689 - 224 = 10519486673473 is a prime.
It is a super-2 number, since 2×105195034506892 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10519503450629) 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, 51065550629 + ... + 51065550834.
It is an arithmetic number, because the mean of its divisors is an integer number (2655408638064).
Almost surely, 210519503450689 is an apocalyptic number.
It is an amenable number.
10519503450689 is a deficient number, since it is larger than the sum of its proper divisors (102131101567).
10519503450689 is a wasteful number, since it uses less digits than its factorization.
10519503450689 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102131101566.
The product of its (nonzero) digits is 5832000, while the sum is 56.
The spelling of 10519503450689 in words is "ten trillion, five hundred nineteen billion, five hundred three million, four hundred fifty thousand, six hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •