Base | Representation |
---|---|
bin | 110001010111101001… |
… | …1000010110100000011 |
3 | 101010122201202012202212 |
4 | 1202233103002310003 |
5 | 3214112134021123 |
6 | 120412141132335 |
7 | 10442165000534 |
oct | 1425723026403 |
9 | 333581665685 |
10 | 106020220163 |
11 | 40a65717670 |
12 | 18669b5a0ab |
13 | 9cc7b37bb0 |
14 | 51ba81468b |
15 | 2b57a18878 |
hex | 18af4c2d03 |
106020220163 has 32 divisors (see below), whose sum is σ = 131978004480. Its totient is φ = 83673653760.
The previous prime is 106020220157. The next prime is 106020220171. The reversal of 106020220163 is 361022020601.
It is a cyclic number.
It is not a de Polignac number, because 106020220163 - 222 = 106016025859 is a prime.
It is a super-2 number, since 2×1060202201632 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106020220123) 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 31 ways as a sum of consecutive naturals, for example, 3483056 + ... + 3513362.
It is an arithmetic number, because the mean of its divisors is an integer number (4124312640).
Almost surely, 2106020220163 is an apocalyptic number.
106020220163 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
106020220163 is a deficient number, since it is larger than the sum of its proper divisors (25957784317).
106020220163 is a wasteful number, since it uses less digits than its factorization.
106020220163 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31787.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 106020220163 its reverse (361022020601), we get a palindrome (467042240764).
The spelling of 106020220163 in words is "one hundred six billion, twenty million, two hundred twenty thousand, one hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •