Base | Representation |
---|---|
bin | 10111001110000100100001… |
… | …100010001100101100100111 |
3 | 111101120202201202201000201112 |
4 | 113032010201202030230213 |
5 | 101341131324000310043 |
6 | 1001110111003215235 |
7 | 30340033234465610 |
oct | 2716044142145447 |
9 | 441522652630645 |
10 | 102122000010023 |
11 | 2a5a2773766224 |
12 | b553b1721751b |
13 | 44ca0a9043456 |
14 | 1b30a344a6c07 |
15 | bc1663118518 |
hex | 5ce12188cb27 |
102122000010023 has 8 divisors (see below), whose sum is σ = 116736833343648. Its totient is φ = 87513660723744.
The previous prime is 102122000010001. The next prime is 102122000010109. The reversal of 102122000010023 is 320010000221201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102122000010023 - 226 = 102121932901159 is a prime.
It is a super-2 number, since 2×1021220000100232 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102122000040023) 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, 1623478136 + ... + 1623541037.
It is an arithmetic number, because the mean of its divisors is an integer number (14592104167956).
Almost surely, 2102122000010023 is an apocalyptic number.
102122000010023 is a deficient number, since it is larger than the sum of its proper divisors (14614833333625).
102122000010023 is an equidigital number, since it uses as much as digits as its factorization.
102122000010023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3247023673.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 102122000010023 its reverse (320010000221201), we get a palindrome (422132000231224).
The spelling of 102122000010023 in words is "one hundred two trillion, one hundred twenty-two billion, ten thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •