Base | Representation |
---|---|
bin | 101100000010110011000… |
… | …0011001001101100010111 |
3 | 210102200200100110010120110 |
4 | 1120011212003021230113 |
5 | 1243134200140202411 |
6 | 20512505101334103 |
7 | 1163223636503400 |
oct | 130054603115427 |
9 | 23380610403513 |
10 | 6053321022231 |
11 | 1a242209a867a |
12 | 819210b67333 |
13 | 34ba97162622 |
14 | 16cda760c9a7 |
15 | a76da1842a6 |
hex | 581660c9b17 |
6053321022231 has 24 divisors (see below), whose sum is σ = 9391541118960. Its totient is φ = 3458039703552.
The previous prime is 6053321022197. The next prime is 6053321022293. The reversal of 6053321022231 is 1322201233506.
It is not a de Polignac number, because 6053321022231 - 27 = 6053321022103 is a prime.
It is a super-2 number, since 2×60533210222312 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6053321022131) 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 23 ways as a sum of consecutive naturals, for example, 5447716 + ... + 6464073.
It is an arithmetic number, because the mean of its divisors is an integer number (391314213290).
Almost surely, 26053321022231 is an apocalyptic number.
6053321022231 is a deficient number, since it is larger than the sum of its proper divisors (3338220096729).
6053321022231 is a wasteful number, since it uses less digits than its factorization.
6053321022231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11915263 (or 11915256 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 30.
Adding to 6053321022231 its reverse (1322201233506), we get a palindrome (7375522255737).
The spelling of 6053321022231 in words is "six trillion, fifty-three billion, three hundred twenty-one million, twenty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •