Base | Representation |
---|---|
bin | 101101101101001000000010… |
… | …011111100000111101100100 |
3 | 222100201122221122021120100022 |
4 | 231231020002133200331210 |
5 | 202321344312402001200 |
6 | 1551304051024134312 |
7 | 60224501015414531 |
oct | 5555100237407544 |
9 | 870648848246308 |
10 | 201013101203300 |
11 | 5905a1a5257191 |
12 | 1a665828a67398 |
13 | 88215b98a1809 |
14 | 378d12c01bd88 |
15 | 1838c2aa98885 |
hex | b6d2027e0f64 |
201013101203300 has 36 divisors (see below), whose sum is σ = 436202258143680. Its totient is φ = 80404534761120.
The previous prime is 201013101203269. The next prime is 201013101203347. The reversal of 201013101203300 is 3302101310102.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2703737 + ... + 20232063.
It is an arithmetic number, because the mean of its divisors is an integer number (12116729392880).
Almost surely, 2201013101203300 is an apocalyptic number.
201013101203300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201013101203300 is an abundant number, since it is smaller than the sum of its proper divisors (235189156940380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201013101203300 is a wasteful number, since it uses less digits than its factorization.
201013101203300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17643020 (or 17643013 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 201013101203300 its reverse (3302101310102), we get a palindrome (204315202513402).
The spelling of 201013101203300 in words is "two hundred one trillion, thirteen billion, one hundred one million, two hundred three thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •