Base | Representation |
---|---|
bin | 1100000101000101… |
… | …01100110001000000 |
3 | 121201221212022000100 |
4 | 12002202230301000 |
5 | 101240141223012 |
6 | 2551302122400 |
7 | 316464311562 |
oct | 60242546100 |
9 | 17657768010 |
10 | 6485101632 |
11 | 2828741929 |
12 | 130ba20400 |
13 | 7c4735859 |
14 | 457407332 |
15 | 27e50b8dc |
hex | 1828acc40 |
6485101632 has 42 divisors (see below), whose sum is σ = 18588374558. Its totient is φ = 2161700352.
The previous prime is 6485101607. The next prime is 6485101633. The reversal of 6485101632 is 2361015846.
It is a happy number.
6485101632 is a `hidden beast` number, since 6 + 4 + 8 + 5 + 10 + 1 + 632 = 666.
It can be written as a sum of positive squares in only one way, i.e., 4078610496 + 2406491136 = 63864^2 + 49056^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (6485101633) 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 5 ways as a sum of consecutive naturals, for example, 5628853 + ... + 5630004.
Almost surely, 26485101632 is an apocalyptic number.
It is an amenable number.
6485101632 is an abundant number, since it is smaller than the sum of its proper divisors (12103272926).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6485101632 is a wasteful number, since it uses less digits than its factorization.
6485101632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11258875 (or 11258862 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 36.
The square root of 6485101632 is about 80530.1287221124. The cubic root of 6485101632 is about 1864.8286331581.
The spelling of 6485101632 in words is "six billion, four hundred eighty-five million, one hundred one thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •