Base | Representation |
---|---|
bin | 1100001010010… |
… | …01000101011111 |
3 | 21002221201002202 |
4 | 12011021011133 |
5 | 202103324411 |
6 | 14042242115 |
7 | 2346036560 |
oct | 605110537 |
9 | 232851082 |
10 | 102011231 |
11 | 52645603 |
12 | 2a1b633b |
13 | 1819909a |
14 | d796167 |
15 | 8e5083b |
hex | 614915f |
102011231 has 4 divisors (see below), whose sum is σ = 116584272. Its totient is φ = 87438192.
The previous prime is 102011227. The next prime is 102011243. The reversal of 102011231 is 132110201.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 132110201 = 61 ⋅2165741.
It is a cyclic number.
It is not a de Polignac number, because 102011231 - 22 = 102011227 is a prime.
It is a super-2 number, since 2×1020112312 = 20812582500270722, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102011251) 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, 7286510 + ... + 7286523.
It is an arithmetic number, because the mean of its divisors is an integer number (29146068).
Almost surely, 2102011231 is an apocalyptic number.
102011231 is a deficient number, since it is larger than the sum of its proper divisors (14573041).
102011231 is an equidigital number, since it uses as much as digits as its factorization.
102011231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14573040.
The product of its (nonzero) digits is 12, while the sum is 11.
The square root of 102011231 is about 10100.0609404102. The cubic root of 102011231 is about 467.2500208741.
Adding to 102011231 its reverse (132110201), we get a palindrome (234121432).
The spelling of 102011231 in words is "one hundred two million, eleven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •