Base | Representation |
---|---|
bin | 1100001010010… |
… | …00110111000111 |
3 | 21002221122211200 |
4 | 12011020313013 |
5 | 202103312221 |
6 | 14042233543 |
7 | 2346034104 |
oct | 605106707 |
9 | 232848750 |
10 | 102010311 |
11 | 52644947 |
12 | 2a1b58b3 |
13 | 18198840 |
14 | d795aab |
15 | 8e50426 |
hex | 6148dc7 |
102010311 has 12 divisors (see below), whose sum is σ = 158682888. Its totient is φ = 62775504.
The previous prime is 102010309. The next prime is 102010331. The reversal of 102010311 is 113010201.
It is not a de Polignac number, because 102010311 - 21 = 102010309 is a prime.
It is a super-2 number, since 2×1020103112 = 20812207100633442, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 102010293 and 102010302.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102010301) 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 11 ways as a sum of consecutive naturals, for example, 435825 + ... + 436058.
It is an arithmetic number, because the mean of its divisors is an integer number (13223574).
Almost surely, 2102010311 is an apocalyptic number.
102010311 is a deficient number, since it is larger than the sum of its proper divisors (56672577).
102010311 is a wasteful number, since it uses less digits than its factorization.
102010311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 871902 (or 871899 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
The square root of 102010311 is about 10100.0153960279. The cubic root of 102010311 is about 467.2486162206.
Adding to 102010311 its reverse (113010201), we get a palindrome (215020512).
The spelling of 102010311 in words is "one hundred two million, ten thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •