Base | Representation |
---|---|
bin | 101101101101000110010111… |
… | …010000100010000000011110 |
3 | 222100201111022020222022211201 |
4 | 231231012113100202000132 |
5 | 202321332121320111220 |
6 | 1551303152315310114 |
7 | 60224405311410313 |
oct | 5555062720420036 |
9 | 870644266868751 |
10 | 201011302113310 |
11 | 59059461764257 |
12 | 1a66540644b33a |
13 | 8821390c3ca20 |
14 | 378cddb100d0a |
15 | 1838b72b6ed0a |
hex | b6d19742201e |
201011302113310 has 32 divisors (see below), whose sum is σ = 410160713628960. Its totient is φ = 70313265191808.
The previous prime is 201011302113301. The next prime is 201011302113311. The reversal of 201011302113310 is 13311203110102.
It is a super-2 number, since 2×2010113021133102 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201011302113311) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 40690544517 + ... + 40690549456.
It is an arithmetic number, because the mean of its divisors is an integer number (12817522300905).
Almost surely, 2201011302113310 is an apocalyptic number.
201011302113310 is an abundant number, since it is smaller than the sum of its proper divisors (209149411515650).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201011302113310 is a wasteful number, since it uses less digits than its factorization.
201011302113310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81381094012.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 201011302113310 its reverse (13311203110102), we get a palindrome (214322505223412).
The spelling of 201011302113310 in words is "two hundred one trillion, eleven billion, three hundred two million, one hundred thirteen thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •