Base | Representation |
---|---|
bin | 100101010101001001010… |
… | …0110111001000110101101 |
3 | 200011111002212022022100101 |
4 | 1022222102212321012231 |
5 | 1133030033024322313 |
6 | 14524553252431101 |
7 | 1036451206465600 |
oct | 112522246710655 |
9 | 20144085268311 |
10 | 5130650620333 |
11 | 16a8995579347 |
12 | 6aa430618491 |
13 | 2b2a839a9234 |
14 | 13a479414337 |
15 | 8d6d77515dd |
hex | 4aa929b91ad |
5130650620333 has 12 divisors (see below), whose sum is σ = 5970394119132. Its totient is φ = 4396163291520.
The previous prime is 5130650620309. The next prime is 5130650620349. The reversal of 5130650620333 is 3330260560315.
It can be written as a sum of positive squares in 2 ways, for example, as 3479019535369 + 1651631084964 = 1865213^2 + 1285158^2 .
It is not a de Polignac number, because 5130650620333 - 29 = 5130650619821 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5130650620292 and 5130650620301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5130650620633) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 18158860 + ... + 18439237.
It is an arithmetic number, because the mean of its divisors is an integer number (497532843261).
Almost surely, 25130650620333 is an apocalyptic number.
It is an amenable number.
5130650620333 is a deficient number, since it is larger than the sum of its proper divisors (839743498799).
5130650620333 is a wasteful number, since it uses less digits than its factorization.
5130650620333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36600972 (or 36600965 counting only the distinct ones).
The product of its (nonzero) digits is 145800, while the sum is 37.
The spelling of 5130650620333 in words is "five trillion, one hundred thirty billion, six hundred fifty million, six hundred twenty thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •