Base | Representation |
---|---|
bin | 1001100100011000011110… |
… | …11001000001010010001001 |
3 | 2202111112021120202201212222 |
4 | 10302030033121001102021 |
5 | 10224220042032001301 |
6 | 112430124031143425 |
7 | 4301120050336061 |
oct | 462141731012211 |
9 | 82445246681788 |
10 | 21041303000201 |
11 | 6782625aa8340 |
12 | 2439b41974b75 |
13 | b9825657a563 |
14 | 52a593d343a1 |
15 | 2674ec6b831b |
hex | 13230f641489 |
21041303000201 has 8 divisors (see below), whose sum is σ = 22964568249504. Its totient is φ = 19119774337920.
The previous prime is 21041303000197. The next prime is 21041303000213. The reversal of 21041303000201 is 10200030314012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21041303000201 - 22 = 21041303000197 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 21041303000201.
It is not an unprimeable number, because it can be changed into a prime (21041303000231) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 434121416 + ... + 434169881.
It is an arithmetic number, because the mean of its divisors is an integer number (2870571031188).
Almost surely, 221041303000201 is an apocalyptic number.
It is an amenable number.
21041303000201 is a deficient number, since it is larger than the sum of its proper divisors (1923265249303).
21041303000201 is a wasteful number, since it uses less digits than its factorization.
21041303000201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 868293511.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 21041303000201 its reverse (10200030314012), we get a palindrome (31241333314213).
The spelling of 21041303000201 in words is "twenty-one trillion, forty-one billion, three hundred three million, two hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •