Base | Representation |
---|---|
bin | 101101110001010011010000… |
… | …111101011101111000001100 |
3 | 222101202002120102002020102122 |
4 | 231301103100331131320030 |
5 | 202341044431422044040 |
6 | 1552043543012312112 |
7 | 60254306321443010 |
oct | 5561232075357014 |
9 | 871662512066378 |
10 | 201300033003020 |
11 | 5915a956827166 |
12 | 1a6b1365912638 |
13 | 8842686170123 |
14 | 379cd8b720540 |
15 | 1841420d331b5 |
hex | b714d0f5de0c |
201300033003020 has 96 divisors (see below), whose sum is σ = 500121956275200. Its totient is φ = 66591577108224.
The previous prime is 201300033003001. The next prime is 201300033003053. The reversal of 201300033003020 is 20300330003102.
It is a self number, because there is not a number n which added to its sum of digits gives 201300033003020.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11067992 + ... + 22915071.
It is an arithmetic number, because the mean of its divisors is an integer number (5209603711200).
Almost surely, 2201300033003020 is an apocalyptic number.
201300033003020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201300033003020 is an abundant number, since it is smaller than the sum of its proper divisors (298821923272180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201300033003020 is a wasteful number, since it uses less digits than its factorization.
201300033003020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33984567 (or 33984565 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 17.
Adding to 201300033003020 its reverse (20300330003102), we get a palindrome (221600363006122).
The spelling of 201300033003020 in words is "two hundred one trillion, three hundred billion, thirty-three million, three thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •