Base | Representation |
---|---|
bin | 1011111101101000… |
… | …11001111001110101 |
3 | 121120121022121200002 |
4 | 11332310121321311 |
5 | 101123143242401 |
6 | 2541151201045 |
7 | 315105326522 |
oct | 57664317165 |
9 | 17517277602 |
10 | 6422634101 |
11 | 27a6456074 |
12 | 12b2b16185 |
13 | 7b4803710 |
14 | 44cdc6149 |
15 | 278cbca6b |
hex | 17ed19e75 |
6422634101 has 8 divisors (see below), whose sum is σ = 6917308440. Its totient is φ = 5928049152.
The previous prime is 6422634079. The next prime is 6422634107. The reversal of 6422634101 is 1014362246.
It can be written as a sum of positive squares in 4 ways, for example, as 374461201 + 6048172900 = 19351^2 + 77770^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 6422634101 - 218 = 6422371957 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6422634107) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 248861 + ... + 273453.
It is an arithmetic number, because the mean of its divisors is an integer number (864663555).
Almost surely, 26422634101 is an apocalyptic number.
It is an amenable number.
6422634101 is a deficient number, since it is larger than the sum of its proper divisors (494674339).
6422634101 is a wasteful number, since it uses less digits than its factorization.
6422634101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44695.
The product of its (nonzero) digits is 6912, while the sum is 29.
The square root of 6422634101 is about 80141.3382780697. The cubic root of 6422634101 is about 1858.8216706198.
Adding to 6422634101 its reverse (1014362246), we get a palindrome (7436996347).
The spelling of 6422634101 in words is "six billion, four hundred twenty-two million, six hundred thirty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •