Base | Representation |
---|---|
bin | 101101110001101111001011… |
… | …010100011001010011111000 |
3 | 222101211221221002010222221002 |
4 | 231301233023110121103320 |
5 | 202342042321244341100 |
6 | 1552105420540104132 |
7 | 60256420106315306 |
oct | 5561571324312370 |
9 | 871757832128832 |
10 | 201330003121400 |
11 | 5917163611073a |
12 | 1a6b712a835048 |
13 | 88454512a209a |
14 | 37a05d1bcb276 |
15 | 18420c70082d5 |
hex | b71bcb5194f8 |
201330003121400 has 24 divisors (see below), whose sum is σ = 468092257257720. Its totient is φ = 80532001248480.
The previous prime is 201330003121397. The next prime is 201330003121427. The reversal of 201330003121400 is 4121300033102.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 503325007604 + ... + 503325008003.
It is an arithmetic number, because the mean of its divisors is an integer number (19503844052405).
Almost surely, 2201330003121400 is an apocalyptic number.
201330003121400 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201330003121400 is an abundant number, since it is smaller than the sum of its proper divisors (266762254136320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201330003121400 is a wasteful number, since it uses less digits than its factorization.
201330003121400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1006650015623 (or 1006650015614 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 201330003121400 its reverse (4121300033102), we get a palindrome (205451303154502).
The spelling of 201330003121400 in words is "two hundred one trillion, three hundred thirty billion, three million, one hundred twenty-one thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •