Base | Representation |
---|---|
bin | 10111001110000100100001… |
… | …101010001101011010101010 |
3 | 111101120202201220122201111222 |
4 | 113032010201222031122222 |
5 | 101341131330020010442 |
6 | 1001110111120222042 |
7 | 30340033261363421 |
oct | 2716044152153252 |
9 | 441522656581458 |
10 | 102122002110122 |
11 | 2a5a2774970045 |
12 | b553b17a6a922 |
13 | 44ca0a95ca307 |
14 | 1b30a348922b8 |
15 | bc16633d08d2 |
hex | 5ce121a8d6aa |
102122002110122 has 4 divisors (see below), whose sum is σ = 153183003165186. Its totient is φ = 51061001055060.
The previous prime is 102122002110109. The next prime is 102122002110127. The reversal of 102122002110122 is 221011200221201.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 60937554675001 + 41184447435121 = 7806251^2 + 6417511^2 .
It is a super-2 number, since 2×1021220021101222 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 102122002110122.
It is not an unprimeable number, because it can be changed into a prime (102122002110127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25530500527529 + ... + 25530500527532.
Almost surely, 2102122002110122 is an apocalyptic number.
102122002110122 is a deficient number, since it is larger than the sum of its proper divisors (51061001055064).
102122002110122 is an equidigital number, since it uses as much as digits as its factorization.
102122002110122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51061001055063.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 102122002110122 its reverse (221011200221201), we get a palindrome (323133202331323).
The spelling of 102122002110122 in words is "one hundred two trillion, one hundred twenty-two billion, two million, one hundred ten thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •