Base | Representation |
---|---|
bin | 101111100101110101… |
… | …0010011100111001001 |
3 | 100202210120102110200122 |
4 | 1133023222103213021 |
5 | 3133301441104113 |
6 | 114541152313025 |
7 | 10245432061445 |
oct | 1371352234711 |
9 | 322716373618 |
10 | 102201113033 |
11 | 3a385955988 |
12 | 17982b42775 |
13 | 98398408a6 |
14 | 4d3750b825 |
15 | 29d25c6408 |
hex | 17cba939c9 |
102201113033 has 4 divisors (see below), whose sum is σ = 102463841220. Its totient is φ = 101938384848.
The previous prime is 102201112969. The next prime is 102201113051. The reversal of 102201113033 is 330311102201.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 330311102201 = 2269 ⋅145575629.
It can be written as a sum of positive squares in 2 ways, for example, as 30542106169 + 71659006864 = 174763^2 + 267692^2 .
It is a cyclic number.
It is not a de Polignac number, because 102201113033 - 26 = 102201112969 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102201113093) 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, 131363510 + ... + 131364287.
It is an arithmetic number, because the mean of its divisors is an integer number (25615960305).
Almost surely, 2102201113033 is an apocalyptic number.
It is an amenable number.
102201113033 is a deficient number, since it is larger than the sum of its proper divisors (262728187).
102201113033 is an equidigital number, since it uses as much as digits as its factorization.
102201113033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 262728186.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 102201113033 its reverse (330311102201), we get a palindrome (432512215234).
The spelling of 102201113033 in words is "one hundred two billion, two hundred one million, one hundred thirteen thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •