Base | Representation |
---|---|
bin | 101101001101001011000… |
… | …0100101110010001001111 |
3 | 210222221221110212211021011 |
4 | 1122122112010232101033 |
5 | 1303243301333434021 |
6 | 21114121552550051 |
7 | 1210606636100443 |
oct | 132322604562117 |
9 | 23887843784234 |
10 | 6213040530511 |
11 | 1a85a324511a1 |
12 | 844166852327 |
13 | 360b6c271ac9 |
14 | 1769d9b8a823 |
15 | ab9371b7de1 |
hex | 5a69612e44f |
6213040530511 has 32 divisors (see below), whose sum is σ = 6830223409152. Its totient is φ = 5628008117760.
The previous prime is 6213040530497. The next prime is 6213040530583. The reversal of 6213040530511 is 1150350403126.
It is not a de Polignac number, because 6213040530511 - 221 = 6213038433359 is a prime.
It is a super-2 number, since 2×62130405305112 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6213040530311) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 250847250 + ... + 250872016.
It is an arithmetic number, because the mean of its divisors is an integer number (213444481536).
Almost surely, 26213040530511 is an apocalyptic number.
6213040530511 is a gapful number since it is divisible by the number (61) formed by its first and last digit.
6213040530511 is a deficient number, since it is larger than the sum of its proper divisors (617182878641).
6213040530511 is a wasteful number, since it uses less digits than its factorization.
6213040530511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30039.
The product of its (nonzero) digits is 10800, while the sum is 31.
Adding to 6213040530511 its reverse (1150350403126), we get a palindrome (7363390933637).
The spelling of 6213040530511 in words is "six trillion, two hundred thirteen billion, forty million, five hundred thirty thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •