Base | Representation |
---|---|
bin | 10010110100000100… |
… | …110100111001101010 |
3 | 1221010211210211010100 |
4 | 102310010310321222 |
5 | 312332431031242 |
6 | 13140310130230 |
7 | 1313412643611 |
oct | 226404647152 |
9 | 57124724110 |
10 | 20201033322 |
11 | 8626a58368 |
12 | 3ab9350976 |
13 | 1b9c234372 |
14 | d98c96878 |
15 | 7d372b54c |
hex | 4b4134e6a |
20201033322 has 12 divisors (see below), whose sum is σ = 43768905570. Its totient is φ = 6733677768.
The previous prime is 20201033297. The next prime is 20201033327. The reversal of 20201033322 is 22333010202.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 20138164281 + 62869041 = 141909^2 + 7929^2 .
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 1122279629 = 20201033322 / (2 + 0 + 2 + 0 + 1 + 0 + 3 + 3 + 3 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 20201033295 and 20201033304.
It is not an unprimeable number, because it can be changed into a prime (20201033327) 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, 561139797 + ... + 561139832.
Almost surely, 220201033322 is an apocalyptic number.
20201033322 is an abundant number, since it is smaller than the sum of its proper divisors (23567872248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20201033322 is a wasteful number, since it uses less digits than its factorization.
20201033322 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1122279637 (or 1122279634 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 18.
Adding to 20201033322 its reverse (22333010202), we get a palindrome (42534043524).
The spelling of 20201033322 in words is "twenty billion, two hundred one million, thirty-three thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •