Base | Representation |
---|---|
bin | 101111100010111000… |
… | …0010001000100110101 |
3 | 100202112122221121220220 |
4 | 1133011300101010311 |
5 | 3133101103342323 |
6 | 114523252244553 |
7 | 10243116532665 |
oct | 1370560210465 |
9 | 322478847826 |
10 | 102102012213 |
11 | 3a334a18a83 |
12 | 17955910759 |
13 | 9822153456 |
14 | 4d282b21a5 |
15 | 29c8a4d0e3 |
hex | 17c5c11135 |
102102012213 has 8 divisors (see below), whose sum is σ = 136720291968. Its totient is φ = 67775870304.
The previous prime is 102102012193. The next prime is 102102012217. The reversal of 102102012213 is 312210201201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102102012213 - 26 = 102102012149 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102102012192 and 102102012201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102102012217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 73033645 + ... + 73035042.
It is an arithmetic number, because the mean of its divisors is an integer number (17090036496).
Almost surely, 2102102012213 is an apocalyptic number.
It is an amenable number.
102102012213 is a deficient number, since it is larger than the sum of its proper divisors (34618279755).
102102012213 is a wasteful number, since it uses less digits than its factorization.
102102012213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146068923.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 102102012213 its reverse (312210201201), we get a palindrome (414312213414).
The spelling of 102102012213 in words is "one hundred two billion, one hundred two million, twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •