Base | Representation |
---|---|
bin | 101101110001110010001001… |
… | …110111111010011110001110 |
3 | 222101212021011212211111122111 |
4 | 231301302021313322132032 |
5 | 202342120343211301220 |
6 | 1552111110102334234 |
7 | 60256562246235262 |
oct | 5561621167723616 |
9 | 871767155744574 |
10 | 201333200103310 |
11 | 59172a26792550 |
12 | 1a6b788142a37a |
13 | 8845840724c62 |
14 | 37a081662c0a2 |
15 | 1842212a0c15a |
hex | b71c89dfa78e |
201333200103310 has 32 divisors (see below), whose sum is σ = 406030198152672. Its totient is φ = 71233368094080.
The previous prime is 201333200103209. The next prime is 201333200103311. The reversal of 201333200103310 is 13301002333102.
It is a super-2 number, since 2×2013332001033102 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201333200103311) 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, 24733804297 + ... + 24733812436.
It is an arithmetic number, because the mean of its divisors is an integer number (12688443692271).
Almost surely, 2201333200103310 is an apocalyptic number.
201333200103310 is an abundant number, since it is smaller than the sum of its proper divisors (204696998049362).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201333200103310 is a wasteful number, since it uses less digits than its factorization.
201333200103310 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49467616788.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 201333200103310 its reverse (13301002333102), we get a palindrome (214634202436412).
The spelling of 201333200103310 in words is "two hundred one trillion, three hundred thirty-three billion, two hundred million, one hundred three thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •