Base | Representation |
---|---|
bin | 1100001010010… |
… | …11100111101100 |
3 | 21002222020100020 |
4 | 12011023213230 |
5 | 202104142422 |
6 | 14042402140 |
7 | 2346112050 |
oct | 605134754 |
9 | 232866306 |
10 | 102021612 |
11 | 52652390 |
12 | 2a200350 |
13 | 181a0a24 |
14 | d799c60 |
15 | 8e5395c |
hex | 614b9ec |
102021612 has 96 divisors (see below), whose sum is σ = 304141824. Its totient is φ = 25843200.
The previous prime is 102021599. The next prime is 102021643. The reversal of 102021612 is 216120201.
It is a junction number, because it is equal to n+sod(n) for n = 102021591 and 102021600.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 36538 + ... + 39230.
It is an arithmetic number, because the mean of its divisors is an integer number (3168144).
Almost surely, 2102021612 is an apocalyptic number.
102021612 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 102021612, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (152070912).
102021612 is an abundant number, since it is smaller than the sum of its proper divisors (202120212).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102021612 is a wasteful number, since it uses less digits than its factorization.
102021612 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2759 (or 2757 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
The square root of 102021612 is about 10100.5748351270. The cubic root of 102021612 is about 467.2658699720.
Adding to 102021612 its reverse (216120201), we get a palindrome (318141813).
The spelling of 102021612 in words is "one hundred two million, twenty-one thousand, six hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •