Base | Representation |
---|---|
bin | 100100110000101010111… |
… | …1000010000011110011001 |
3 | 122212222221000211221201002 |
4 | 1021201111320100132121 |
5 | 1130234124010213001 |
6 | 14425001014034345 |
7 | 1031006154256412 |
oct | 111412570203631 |
9 | 18788830757632 |
10 | 5052322351001 |
11 | 1678750287262 |
12 | 6972106489b5 |
13 | 2a8580003683 |
14 | 1367686c2809 |
15 | 8b650e0046b |
hex | 49855e10799 |
5052322351001 has 16 divisors (see below), whose sum is σ = 5111906983680. Its totient is φ = 4992894466560.
The previous prime is 5052322350997. The next prime is 5052322351003. The reversal of 5052322351001 is 1001532232505.
It is a cyclic number.
It is not a de Polignac number, because 5052322351001 - 22 = 5052322350997 is a prime.
It is a super-2 number, since 2×50523223510012 (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 (5052322351003) 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 15 ways as a sum of consecutive naturals, for example, 355865435 + ... + 355879631.
It is an arithmetic number, because the mean of its divisors is an integer number (319494186480).
Almost surely, 25052322351001 is an apocalyptic number.
It is an amenable number.
5052322351001 is a deficient number, since it is larger than the sum of its proper divisors (59584632679).
5052322351001 is a wasteful number, since it uses less digits than its factorization.
5052322351001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19424.
The product of its (nonzero) digits is 9000, while the sum is 29.
Adding to 5052322351001 its reverse (1001532232505), we get a palindrome (6053854583506).
The spelling of 5052322351001 in words is "five trillion, fifty-two billion, three hundred twenty-two million, three hundred fifty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •