Base | Representation |
---|---|
bin | 10111001100100101101000… |
… | …100110111111010001111111 |
3 | 111101020000202002202111000012 |
4 | 113030211220212333101333 |
5 | 101332444142441424043 |
6 | 1000551220520053435 |
7 | 30326465340252536 |
oct | 2714455046772177 |
9 | 441200662674005 |
10 | 102020113233023 |
11 | 2a56353a296697 |
12 | b53822160427b |
13 | 44c05bc67ca1b |
14 | 1b29b2aa2131d |
15 | bbdb9d433a18 |
hex | 5cc9689bf47f |
102020113233023 has 6 divisors (see below), whose sum is σ = 104447849839704. Its totient is φ = 99647552458356.
The previous prime is 102020113233019. The next prime is 102020113233067. The reversal of 102020113233023 is 320332311020201.
It is not a de Polignac number, because 102020113233023 - 22 = 102020113233019 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 102020113233023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102020113230023) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 27587914115 + ... + 27587917812.
It is an arithmetic number, because the mean of its divisors is an integer number (17407974973284).
Almost surely, 2102020113233023 is an apocalyptic number.
102020113233023 is a deficient number, since it is larger than the sum of its proper divisors (2427736606681).
102020113233023 is an frugal number, since it uses more digits than its factorization.
102020113233023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55175832013 (or 55175831970 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 102020113233023 its reverse (320332311020201), we get a palindrome (422352424253224).
The spelling of 102020113233023 in words is "one hundred two trillion, twenty billion, one hundred thirteen million, two hundred thirty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •