Base | Representation |
---|---|
bin | 10110111101111001111011… |
… | …111011010101101010011010 |
3 | 111020122120100122000111122212 |
4 | 112331321323323111222122 |
5 | 101214431233211120442 |
6 | 554455511245515122 |
7 | 30163545501411104 |
oct | 2675717373255232 |
9 | 436576318014585 |
10 | 101011120020122 |
11 | 2a204636995844 |
12 | b3b476b872aa2 |
13 | 444940016c240 |
14 | 1ad2d7004c574 |
15 | ba27e73d1a82 |
hex | 5bde7bed5a9a |
101011120020122 has 16 divisors (see below), whose sum is σ = 164417395599072. Its totient is φ = 46264635122160.
The previous prime is 101011120020121. The next prime is 101011120020179. The reversal of 101011120020122 is 221020021110101.
It is a super-3 number, since 3×1010111200201223 (a number of 43 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101011120020097 and 101011120020106.
It is not an unprimeable number, because it can be changed into a prime (101011120020121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14828405288 + ... + 14828412099.
It is an arithmetic number, because the mean of its divisors is an integer number (10276087224942).
Almost surely, 2101011120020122 is an apocalyptic number.
101011120020122 is a deficient number, since it is larger than the sum of its proper divisors (63406275578950).
101011120020122 is a wasteful number, since it uses less digits than its factorization.
101011120020122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29656817533.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 101011120020122 its reverse (221020021110101), we get a palindrome (322031141130223).
The spelling of 101011120020122 in words is "one hundred one trillion, eleven billion, one hundred twenty million, twenty thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •