Base | Representation |
---|---|
bin | 101101101101000110001011… |
… | …110100000110011011111100 |
3 | 222100201110210212200121011000 |
4 | 231231012023310012123330 |
5 | 202321331223142022342 |
6 | 1551303121300130300 |
7 | 60224400460412610 |
oct | 5555061364063374 |
9 | 870643725617130 |
10 | 201011110110972 |
11 | 59059373344037 |
12 | 1a665372096990 |
13 | 8821360225a85 |
14 | 378cdbd801340 |
15 | 1838b60d9544c |
hex | b6d18bd066fc |
201011110110972 has 96 divisors (see below), whose sum is σ = 606825992908800. Its totient is φ = 56348127890496.
The previous prime is 201011110110971. The next prime is 201011110110973. The reversal of 201011110110972 is 279011011110102.
It is an interprime number because it is at equal distance from previous prime (201011110110971) and next prime (201011110110973).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201011110110971) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2508334572 + ... + 2508414707.
It is an arithmetic number, because the mean of its divisors is an integer number (6321104092800).
Almost surely, 2201011110110972 is an apocalyptic number.
It is an amenable number.
201011110110972 is an abundant number, since it is smaller than the sum of its proper divisors (405814882797828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201011110110972 is a wasteful number, since it uses less digits than its factorization.
201011110110972 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5016749352 (or 5016749344 counting only the distinct ones).
The product of its (nonzero) digits is 252, while the sum is 27.
The spelling of 201011110110972 in words is "two hundred one trillion, eleven billion, one hundred ten million, one hundred ten thousand, nine hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •