Base | Representation |
---|---|
bin | 1001001001101000010101… |
… | …00111111011011100010011 |
3 | 2122020122122202012020102011 |
4 | 10210310022213323130103 |
5 | 10114140030101133021 |
6 | 110443544245203351 |
7 | 4144526253046342 |
oct | 444641247733423 |
9 | 78218582166364 |
10 | 20122100021011 |
11 | 645880997500a |
12 | 230b96a700557 |
13 | b2c676595691 |
14 | 4d7cb4457b59 |
15 | 24d64e3a9de1 |
hex | 124d0a9fb713 |
20122100021011 has 12 divisors (see below), whose sum is σ = 21391537590360. Its totient is φ = 18921001906400.
The previous prime is 20122100020943. The next prime is 20122100021029. The reversal of 20122100021011 is 11012000122102.
It is not a de Polignac number, because 20122100021011 - 227 = 20121965803283 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20122100020982 and 20122100021000.
It is not an unprimeable number, because it can be changed into a prime (20122100021311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 322324690 + ... + 322387111.
It is an arithmetic number, because the mean of its divisors is an integer number (1782628132530).
Almost surely, 220122100021011 is an apocalyptic number.
20122100021011 is a deficient number, since it is larger than the sum of its proper divisors (1269437569349).
20122100021011 is an equidigital number, since it uses as much as digits as its factorization.
20122100021011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 644711906 (or 644711883 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 20122100021011 its reverse (11012000122102), we get a palindrome (31134100143113).
The spelling of 20122100021011 in words is "twenty trillion, one hundred twenty-two billion, one hundred million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •