Base | Representation |
---|---|
bin | 101101101101010001010001… |
… | …110100110100010101010010 |
3 | 222100202121120001020110202120 |
4 | 231231101101310310111102 |
5 | 202322030122130403242 |
6 | 1551312411303555110 |
7 | 60225301613011641 |
oct | 5555212164642522 |
9 | 870677501213676 |
10 | 201023022122322 |
11 | 59063426368514 |
12 | 1a66773745ba96 |
13 | 882250b090cba |
14 | 378d7cd877358 |
15 | 183910ba351ec |
hex | b6d451d34552 |
201023022122322 has 32 divisors (see below), whose sum is σ = 408068699980032. Its totient is φ = 66004005773904.
The previous prime is 201023022122303. The next prime is 201023022122323. The reversal of 201023022122322 is 223221220320102.
It is a junction number, because it is equal to n+sod(n) for n = 201023022122292 and 201023022122301.
It is not an unprimeable number, because it can be changed into a prime (201023022122323) 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 15 ways as a sum of consecutive naturals, for example, 5979828 + ... + 20923775.
It is an arithmetic number, because the mean of its divisors is an integer number (12752146874376).
Almost surely, 2201023022122322 is an apocalyptic number.
201023022122322 is an abundant number, since it is smaller than the sum of its proper divisors (207045677857710).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201023022122322 is a wasteful number, since it uses less digits than its factorization.
201023022122322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26922262.
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 201023022122322 its reverse (223221220320102), we get a palindrome (424244242442424).
The spelling of 201023022122322 in words is "two hundred one trillion, twenty-three billion, twenty-two million, one hundred twenty-two thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •