Base | Representation |
---|---|
bin | 1100001010111… |
… | …11010110010000 |
3 | 21010010100011222 |
4 | 12011133112100 |
5 | 202114234131 |
6 | 14044224212 |
7 | 2346566453 |
oct | 605372620 |
9 | 233110158 |
10 | 102102416 |
11 | 526a8069 |
12 | 2a23b068 |
13 | 181cb740 |
14 | d7bb49a |
15 | 8e6c87b |
hex | 615f590 |
102102416 has 20 divisors (see below), whose sum is σ = 213041052. Its totient is φ = 47124096.
The previous prime is 102102383. The next prime is 102102419. The reversal of 102102416 is 614201201.
It can be written as a sum of positive squares in 2 ways, for example, as 12988816 + 89113600 = 3604^2 + 9440^2 .
It is a junction number, because it is equal to n+sod(n) for n = 102102394 and 102102403.
It is not an unprimeable number, because it can be changed into a prime (102102419) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 245231 + ... + 245646.
Almost surely, 2102102416 is an apocalyptic number.
102102416 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
102102416 is an abundant number, since it is smaller than the sum of its proper divisors (110938636).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102102416 is a wasteful number, since it uses less digits than its factorization.
102102416 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 490898 (or 490892 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 17.
The square root of 102102416 is about 10104.5740137821. The cubic root of 102102416 is about 467.3892000090.
Adding to 102102416 its reverse (614201201), we get a palindrome (716303617).
The spelling of 102102416 in words is "one hundred two million, one hundred two thousand, four hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •