Base | Representation |
---|---|
bin | 1011101100111001110… |
… | …1000110100001101110 |
3 | 201012220021121110021000 |
4 | 2323032131012201232 |
5 | 11243203222343042 |
6 | 232204122221130 |
7 | 20344523524620 |
oct | 2731635064156 |
9 | 635807543230 |
10 | 201032231022 |
11 | 782914a9697 |
12 | 32b653547a6 |
13 | 15c5a13296c |
14 | 9a3121cc10 |
15 | 5368dc074c |
hex | 2ece74686e |
201032231022 has 64 divisors (see below), whose sum is σ = 537429542400. Its totient is φ = 54414737280.
The previous prime is 201032230981. The next prime is 201032231051. The reversal of 201032231022 is 220132230102.
201032231022 is a `hidden beast` number, since 2 + 0 + 10 + 322 + 310 + 22 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 201032230986 and 201032231004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 13988379 + ... + 14002742.
It is an arithmetic number, because the mean of its divisors is an integer number (8397336600).
Almost surely, 2201032231022 is an apocalyptic number.
201032231022 is an abundant number, since it is smaller than the sum of its proper divisors (336397311378).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201032231022 is a wasteful number, since it uses less digits than its factorization.
201032231022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27991158 (or 27991152 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 201032231022 its reverse (220132230102), we get a palindrome (421164461124).
The spelling of 201032231022 in words is "two hundred one billion, thirty-two million, two hundred thirty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •