Base | Representation |
---|---|
bin | 1100000010001111… |
… | …00110110001111101 |
3 | 121200021221002100000 |
4 | 12001013212301331 |
5 | 101213033101023 |
6 | 2545050224513 |
7 | 316054323651 |
oct | 60107466175 |
9 | 17607832300 |
10 | 6461222013 |
11 | 2816211804 |
12 | 1303a25139 |
13 | 7bc7c45bc |
14 | 45418ca61 |
15 | 27c391243 |
hex | 1811e6c7d |
6461222013 has 12 divisors (see below), whose sum is σ = 9678538688. Its totient is φ = 4307481180.
The previous prime is 6461221981. The next prime is 6461222039. The reversal of 6461222013 is 3102221646.
6461222013 is a `hidden beast` number, since 646 + 1 + 2 + 2 + 2 + 0 + 13 = 666.
It is not a de Polignac number, because 6461222013 - 25 = 6461221981 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6461222063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 13294453 + ... + 13294938.
Almost surely, 26461222013 is an apocalyptic number.
It is an amenable number.
6461222013 is a deficient number, since it is larger than the sum of its proper divisors (3217316675).
6461222013 is an equidigital number, since it uses as much as digits as its factorization.
6461222013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26589406 (or 26589394 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
The square root of 6461222013 is about 80381.7268600271. The cubic root of 6461222013 is about 1862.5369102665.
Adding to 6461222013 its reverse (3102221646), we get a palindrome (9563443659).
The spelling of 6461222013 in words is "six billion, four hundred sixty-one million, two hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •