Base | Representation |
---|---|
bin | 10111001111010110100110… |
… | …000001101011011110101001 |
3 | 111101220012012011011011010120 |
4 | 113033112212001223132221 |
5 | 101344102312240413001 |
6 | 1001214403143433453 |
7 | 30346303052655363 |
oct | 2717264601533651 |
9 | 441805164134116 |
10 | 102210122201001 |
11 | 2a627084408631 |
12 | b56900b155889 |
13 | 45054b0b01619 |
14 | 1b34dd3c35d33 |
15 | bc3abe6bc236 |
hex | 5cf5a606b7a9 |
102210122201001 has 8 divisors (see below), whose sum is σ = 138851486763840. Its totient is φ = 66854419552752.
The previous prime is 102210122200937. The next prime is 102210122201009. The reversal of 102210122201001 is 100102221012201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102210122201001 - 26 = 102210122200937 is a prime.
It is a super-3 number, since 3×1022101222010013 (a number of 43 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (102210122201009) 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, 321415478461 + ... + 321415478778.
It is an arithmetic number, because the mean of its divisors is an integer number (17356435845480).
Almost surely, 2102210122201001 is an apocalyptic number.
It is an amenable number.
102210122201001 is a deficient number, since it is larger than the sum of its proper divisors (36641364562839).
102210122201001 is an equidigital number, since it uses as much as digits as its factorization.
102210122201001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 642830957295.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 102210122201001 its reverse (100102221012201), we get a palindrome (202312343213202).
The spelling of 102210122201001 in words is "one hundred two trillion, two hundred ten billion, one hundred twenty-two million, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •