Base | Representation |
---|---|
bin | 101111100010111000… |
… | …1000100010111111011 |
3 | 100202112200100022011001 |
4 | 1133011301010113323 |
5 | 3133101132103311 |
6 | 114523300545431 |
7 | 10243121366404 |
oct | 1370561042773 |
9 | 322480308131 |
10 | 102102222331 |
11 | 3a33505192a |
12 | 179559b2277 |
13 | 98221c7c95 |
14 | 4d283289ab |
15 | 29c8a904c1 |
hex | 17c5c445fb |
102102222331 has 8 divisors (see below), whose sum is σ = 103349965824. Its totient is φ = 100854897960.
The previous prime is 102102222307. The next prime is 102102222349. The reversal of 102102222331 is 133222201201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102102222331 is a prime.
It is a super-2 number, since 2×1021022223312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102102222299 and 102102222308.
It is not an unprimeable number, because it can be changed into a prime (102102222301) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 400186 + ... + 603616.
It is an arithmetic number, because the mean of its divisors is an integer number (12918745728).
Almost surely, 2102102222331 is an apocalyptic number.
102102222331 is a deficient number, since it is larger than the sum of its proper divisors (1247743493).
102102222331 is an equidigital number, since it uses as much as digits as its factorization.
102102222331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 209561.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 102102222331 its reverse (133222201201), we get a palindrome (235324423532).
The spelling of 102102222331 in words is "one hundred two billion, one hundred two million, two hundred twenty-two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •