Base | Representation |
---|---|
bin | 1100010000101… |
… | …01011000011111 |
3 | 21011112012222100 |
4 | 12020111120133 |
5 | 202312114111 |
6 | 14112220143 |
7 | 2356123326 |
oct | 610253037 |
9 | 234465870 |
10 | 102848031 |
11 | 53067280 |
12 | 2a53a653 |
13 | 183ccc30 |
14 | d9330bd |
15 | 9068756 |
hex | 621561f |
102848031 has 48 divisors (see below), whose sum is σ = 175986720. Its totient is φ = 57058560.
The previous prime is 102848027. The next prime is 102848051. The reversal of 102848031 is 130848201.
It is not a de Polignac number, because 102848031 - 22 = 102848027 is a prime.
It is a super-2 number, since 2×1028480312 = 21155434961153922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102847986 and 102848004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102848051) 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 47 ways as a sum of consecutive naturals, for example, 201805 + ... + 202313.
It is an arithmetic number, because the mean of its divisors is an integer number (3666390).
Almost surely, 2102848031 is an apocalyptic number.
102848031 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
102848031 is a deficient number, since it is larger than the sum of its proper divisors (73138689).
102848031 is a wasteful number, since it uses less digits than its factorization.
102848031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 696 (or 693 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 27.
The square root of 102848031 is about 10141.4018261777. The cubic root of 102848031 is about 468.5241634262.
The spelling of 102848031 in words is "one hundred two million, eight hundred forty-eight thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.033 sec. • engine limits •