Base | Representation |
---|---|
bin | 1100000100111010… |
… | …00100100010000001 |
3 | 121201212002022222111 |
4 | 12002131010202001 |
5 | 101234302013423 |
6 | 2551210335321 |
7 | 316445625016 |
oct | 60235044201 |
9 | 17655068874 |
10 | 6483626113 |
11 | 2827924298 |
12 | 130b42a541 |
13 | 7c433a073 |
14 | 45714170d |
15 | 27e31960d |
hex | 182744881 |
6483626113 has 4 divisors (see below), whose sum is σ = 6580396720. Its totient is φ = 6386855508.
The previous prime is 6483626111. The next prime is 6483626119. The reversal of 6483626113 is 3116263846.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 6483626113 - 21 = 6483626111 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6483626111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 48385203 + ... + 48385336.
It is an arithmetic number, because the mean of its divisors is an integer number (1645099180).
Almost surely, 26483626113 is an apocalyptic number.
It is an amenable number.
6483626113 is a deficient number, since it is larger than the sum of its proper divisors (96770607).
6483626113 is an equidigital number, since it uses as much as digits as its factorization.
6483626113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96770606.
The product of its digits is 124416, while the sum is 40.
The square root of 6483626113 is about 80520.9669154562. The cubic root of 6483626113 is about 1864.6871910781.
Adding to 6483626113 its reverse (3116263846), we get a palindrome (9599889959).
The spelling of 6483626113 in words is "six billion, four hundred eighty-three million, six hundred twenty-six thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •