Base | Representation |
---|---|
bin | 1100001010101… |
… | …01010101000001 |
3 | 21010001020220000 |
4 | 12011111111001 |
5 | 202111431002 |
6 | 14043310213 |
7 | 2346336015 |
oct | 605252501 |
9 | 233036800 |
10 | 102061377 |
11 | 5267a250 |
12 | 2a21b369 |
13 | 181b5b62 |
14 | d7aa545 |
15 | 8e6061c |
hex | 6155541 |
102061377 has 20 divisors (see below), whose sum is σ = 166323696. Its totient is φ = 61854840.
The previous prime is 102061343. The next prime is 102061381. The reversal of 102061377 is 773160201.
It is not a de Polignac number, because 102061377 - 26 = 102061313 is a prime.
It is a super-2 number, since 2×1020613772 = 20833049350272258, which contains 22 as substring.
It is a hoax number, since the sum of its digits (27) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a self number, because there is not a number n which added to its sum of digits gives 102061377.
It is not an unprimeable number, because it can be changed into a prime (102061777) 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 19 ways as a sum of consecutive naturals, for example, 56383 + ... + 58164.
Almost surely, 2102061377 is an apocalyptic number.
It is an amenable number.
102061377 is a deficient number, since it is larger than the sum of its proper divisors (64262319).
102061377 is a wasteful number, since it uses less digits than its factorization.
102061377 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114570 (or 114561 counting only the distinct ones).
The product of its (nonzero) digits is 1764, while the sum is 27.
The square root of 102061377 is about 10102.5430956765. The cubic root of 102061377 is about 467.3265708810.
The spelling of 102061377 in words is "one hundred two million, sixty-one thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •