Base | Representation |
---|---|
bin | 101101101110110100111010… |
… | …011000100011110101000010 |
3 | 222101010211200201200012212200 |
4 | 231232310322120203311002 |
5 | 202330303221233133442 |
6 | 1551433503043534030 |
7 | 60236106654443040 |
oct | 5556647230436502 |
9 | 871124621605780 |
10 | 201130003021122 |
11 | 590a483429116a |
12 | 1a68441308a316 |
13 | 882c629c49396 |
14 | 3794a5bac1390 |
15 | 183bcbda6434c |
hex | b6ed3a623d42 |
201130003021122 has 48 divisors (see below), whose sum is σ = 498070504863360. Its totient is φ = 57461756659776.
The previous prime is 201130003021109. The next prime is 201130003021201. The reversal of 201130003021122 is 221120300031102.
201130003021122 is a `hidden beast` number, since 20 + 11 + 300 + 0 + 302 + 11 + 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 = 201130003021095 and 201130003021104.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 53142363 + ... + 56801150.
It is an arithmetic number, because the mean of its divisors is an integer number (10376468851320).
Almost surely, 2201130003021122 is an apocalyptic number.
201130003021122 is an abundant number, since it is smaller than the sum of its proper divisors (296940501842238).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201130003021122 is a wasteful number, since it uses less digits than its factorization.
201130003021122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109958047 (or 109958044 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 201130003021122 its reverse (221120300031102), we get a palindrome (422250303052224).
The spelling of 201130003021122 in words is "two hundred one trillion, one hundred thirty billion, three million, twenty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •