Base | Representation |
---|---|
bin | 1011101101010001110… |
… | …1100101100010001010 |
3 | 201020011022021010120002 |
4 | 2323110131211202022 |
5 | 11243410023140242 |
6 | 232222122403002 |
7 | 20350156321112 |
oct | 2732435454212 |
9 | 636138233502 |
10 | 201133021322 |
11 | 7833338a962 |
12 | 32b93060462 |
13 | 15c74c920ac |
14 | 9a40778042 |
15 | 5372b7e432 |
hex | 2ed476588a |
201133021322 has 8 divisors (see below), whose sum is σ = 303366380772. Its totient is φ = 100010894400.
The previous prime is 201133021319. The next prime is 201133021339. The reversal of 201133021322 is 223120331102.
201133021322 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 123609199561 + 77523821761 = 351581^2 + 278431^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×2011330213222 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 201133021294 and 201133021303.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 277807679 + ... + 277808402.
Almost surely, 2201133021322 is an apocalyptic number.
201133021322 is a deficient number, since it is larger than the sum of its proper divisors (102233359450).
201133021322 is a wasteful number, since it uses less digits than its factorization.
201133021322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 555616264.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 201133021322 its reverse (223120331102), we get a palindrome (424253352424).
The spelling of 201133021322 in words is "two hundred one billion, one hundred thirty-three million, twenty-one thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •