Base | Representation |
---|---|
bin | 101101000111110111100… |
… | …1010000110101010100101 |
3 | 210221212112122222122222211 |
4 | 1122033233022012222211 |
5 | 1303101434423231433 |
6 | 21104555422523421 |
7 | 1210024450013332 |
oct | 132175712065245 |
9 | 23855478878884 |
10 | 6201650211493 |
11 | 1a8111795aa00 |
12 | 841b08136571 |
13 | 35ca75515479 |
14 | 176239115989 |
15 | ab4bc2288cd |
hex | 5a3ef286aa5 |
6201650211493 has 12 divisors (see below), whose sum is σ = 6854771992320. Its totient is φ = 5606367363080.
The previous prime is 6201650211461. The next prime is 6201650211563. The reversal of 6201650211493 is 3941120561026.
It is not a de Polignac number, because 6201650211493 - 25 = 6201650211461 is a prime.
It is a super-2 number, since 2×62016502114932 (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 (6201650211293) 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 11 ways as a sum of consecutive naturals, for example, 143144005 + ... + 143187322.
It is an arithmetic number, because the mean of its divisors is an integer number (571230999360).
Almost surely, 26201650211493 is an apocalyptic number.
It is an amenable number.
6201650211493 is a deficient number, since it is larger than the sum of its proper divisors (653121780827).
6201650211493 is a wasteful number, since it uses less digits than its factorization.
6201650211493 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 286331528 (or 286331517 counting only the distinct ones).
The product of its (nonzero) digits is 77760, while the sum is 40.
The spelling of 6201650211493 in words is "six trillion, two hundred one billion, six hundred fifty million, two hundred eleven thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •