Base | Representation |
---|---|
bin | 100101010100111100111… |
… | …0110100101010110011001 |
3 | 200011110000220211000111211 |
4 | 1022221321312211112121 |
5 | 1133023210214201241 |
6 | 14524444135023121 |
7 | 1036435004401042 |
oct | 112517166452631 |
9 | 20143026730454 |
10 | 5130235303321 |
11 | 16a87a20a1547 |
12 | 6aa33550aaa1 |
13 | 2b2a18933c1b |
14 | 13a43a1c38c9 |
15 | 8d6b1064781 |
hex | 4aa79da5599 |
5130235303321 has 8 divisors (see below), whose sum is σ = 5136681405024. Its totient is φ = 5123793228960.
The previous prime is 5130235303279. The next prime is 5130235303339. The reversal of 5130235303321 is 1233035320315.
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 5130235303321 - 223 = 5130226914713 is a prime.
It is a super-2 number, since 2×51302353033212 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5130235303351) 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, 1546530 + ... + 3556996.
It is an arithmetic number, because the mean of its divisors is an integer number (642085175628).
Almost surely, 25130235303321 is an apocalyptic number.
It is an amenable number.
5130235303321 is a deficient number, since it is larger than the sum of its proper divisors (6446101703).
5130235303321 is a wasteful number, since it uses less digits than its factorization.
5130235303321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2013671.
The product of its (nonzero) digits is 24300, while the sum is 31.
The spelling of 5130235303321 in words is "five trillion, one hundred thirty billion, two hundred thirty-five million, three hundred three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •