Base | Representation |
---|---|
bin | 101111100000011111… |
… | …1000011000111000101 |
3 | 100202100002101122022002 |
4 | 1133000333003013011 |
5 | 3132420113013333 |
6 | 114511313315045 |
7 | 10241125462265 |
oct | 1370077030705 |
9 | 322302348262 |
10 | 102022001093 |
11 | 3a2a383a491 |
12 | 17932b65a85 |
13 | 980b6bacac |
14 | 4d1b8057a5 |
15 | 29c19e60e8 |
hex | 17c0fc31c5 |
102022001093 has 4 divisors (see below), whose sum is σ = 102133016160. Its totient is φ = 101910986028.
The previous prime is 102022001089. The next prime is 102022001113. The reversal of 102022001093 is 390100220201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 102022001093 - 22 = 102022001089 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102022001033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 55506155 + ... + 55507992.
It is an arithmetic number, because the mean of its divisors is an integer number (25533254040).
Almost surely, 2102022001093 is an apocalyptic number.
It is an amenable number.
102022001093 is a deficient number, since it is larger than the sum of its proper divisors (111015067).
102022001093 is an equidigital number, since it uses as much as digits as its factorization.
102022001093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111015066.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 102022001093 its reverse (390100220201), we get a palindrome (492122221294).
The spelling of 102022001093 in words is "one hundred two billion, twenty-two million, one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •