Base | Representation |
---|---|
bin | 1100001011101… |
… | …11011011000111 |
3 | 21010022100110101 |
4 | 12011313123013 |
5 | 202130413111 |
6 | 14050304531 |
7 | 2350460122 |
oct | 605673307 |
9 | 233270411 |
10 | 102201031 |
11 | 52765169 |
12 | 2a288147 |
13 | 182345aa |
14 | d8053b9 |
15 | 8e8bbc1 |
hex | 61776c7 |
102201031 has 4 divisors (see below), whose sum is σ = 102253864. Its totient is φ = 102148200.
The previous prime is 102201007. The next prime is 102201061. The reversal of 102201031 is 130102201.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 130102201 = 599 ⋅217199.
It is a cyclic number.
It is not a de Polignac number, because 102201031 - 29 = 102200519 is a prime.
It is a super-2 number, since 2×1022010312 = 20890101474925922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102200999 and 102201017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102201061) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23400 + ... + 27421.
It is an arithmetic number, because the mean of its divisors is an integer number (25563466).
Almost surely, 2102201031 is an apocalyptic number.
102201031 is a deficient number, since it is larger than the sum of its proper divisors (52833).
102201031 is an equidigital number, since it uses as much as digits as its factorization.
102201031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52832.
The product of its (nonzero) digits is 12, while the sum is 10.
The square root of 102201031 is about 10109.4525568895. The cubic root of 102201031 is about 467.5396265990.
Adding to 102201031 its reverse (130102201), we get a palindrome (232303232).
The spelling of 102201031 in words is "one hundred two million, two hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •