Base | Representation |
---|---|
bin | 101101101100111110000000… |
… | …101010111101110001101000 |
3 | 222100200122011012102221222001 |
4 | 231230332000222331301220 |
5 | 202321210234301412412 |
6 | 1551255110325140344 |
7 | 60223640124235060 |
oct | 5554760052756150 |
9 | 870618135387861 |
10 | 201002333232232 |
11 | 59055679a98144 |
12 | 1a66372285a6b4 |
13 | 8820591a66abc |
14 | 378c7c9caa3a0 |
15 | 18387ea58d957 |
hex | b6cf80abdc68 |
201002333232232 has 64 divisors (see below), whose sum is σ = 437337533001600. Its totient is φ = 84829904674560.
The previous prime is 201002333232209. The next prime is 201002333232251. The reversal of 201002333232232 is 232232333200102.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a self number, because there is not a number n which added to its sum of digits gives 201002333232232.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 100016119 + ... + 102006022.
It is an arithmetic number, because the mean of its divisors is an integer number (6833398953150).
Almost surely, 2201002333232232 is an apocalyptic number.
It is an amenable number.
201002333232232 is an abundant number, since it is smaller than the sum of its proper divisors (236335199769368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201002333232232 is a wasteful number, since it uses less digits than its factorization.
201002333232232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 202022426 (or 202022422 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 28.
Adding to 201002333232232 its reverse (232232333200102), we get a palindrome (433234666432334).
The spelling of 201002333232232 in words is "two hundred one trillion, two billion, three hundred thirty-three million, two hundred thirty-two thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •