Base | Representation |
---|---|
bin | 100101010001001000011… |
… | …0010111111100001000101 |
3 | 200010122212002122211110012 |
4 | 1022202100302333201011 |
5 | 1132404404224201201 |
6 | 14521010033240005 |
7 | 1036024454140142 |
oct | 112422062774105 |
9 | 20118762584405 |
10 | 5122030303301 |
11 | 16a527163659a |
12 | 6a8825703005 |
13 | 2b200baa5a22 |
14 | 139c9c5d53c9 |
15 | 8d380a735bb |
hex | 4a890cbf845 |
5122030303301 has 8 divisors (see below), whose sum is σ = 5405056267200. Its totient is φ = 4840348881600.
The previous prime is 5122030303297. The next prime is 5122030303319. The reversal of 5122030303301 is 1033030302215.
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 5122030303301 - 22 = 5122030303297 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5122030303321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 336127721 + ... + 336142958.
It is an arithmetic number, because the mean of its divisors is an integer number (675632033400).
Almost surely, 25122030303301 is an apocalyptic number.
It is an amenable number.
5122030303301 is a deficient number, since it is larger than the sum of its proper divisors (283025963899).
5122030303301 is a wasteful number, since it uses less digits than its factorization.
5122030303301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 672271099.
The product of its (nonzero) digits is 1620, while the sum is 23.
Adding to 5122030303301 its reverse (1033030302215), we get a palindrome (6155060605516).
The spelling of 5122030303301 in words is "five trillion, one hundred twenty-two billion, thirty million, three hundred three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.132 sec. • engine limits •