Base | Representation |
---|---|
bin | 1111101011110000… |
… | …10011101110110101 |
3 | 210201210222202000000 |
4 | 13311320103232311 |
5 | 114221024133401 |
6 | 3511304541513 |
7 | 415442026623 |
oct | 76570235665 |
9 | 23653882000 |
10 | 8420146101 |
11 | 3630a53434 |
12 | 176ba81899 |
13 | a425b9493 |
14 | 59c3d4513 |
15 | 34433d186 |
hex | 1f5e13bb5 |
8420146101 has 28 divisors (see below), whose sum is σ = 12723988992. Its totient is φ = 5569169256.
The previous prime is 8420146079. The next prime is 8420146117. The reversal of 8420146101 is 1016410248.
It is a happy number.
8420146101 is a `hidden beast` number, since 8 + 42 + 0 + 1 + 4 + 610 + 1 = 666.
It is not a de Polignac number, because 8420146101 - 26 = 8420146037 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (8420146151) by changing a digit.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 47110 + ... + 138056.
Almost surely, 28420146101 is an apocalyptic number.
8420146101 is a gapful number since it is divisible by the number (81) formed by its first and last digit.
It is an amenable number.
8420146101 is a deficient number, since it is larger than the sum of its proper divisors (4303842891).
8420146101 is an equidigital number, since it uses as much as digits as its factorization.
8420146101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91092 (or 91077 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 27.
The square root of 8420146101 is about 91761.3540713083. The cubic root of 8420146101 is about 2034.4165291529.
Adding to 8420146101 its reverse (1016410248), we get a palindrome (9436556349).
The spelling of 8420146101 in words is "eight billion, four hundred twenty million, one hundred forty-six thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •