Base | Representation |
---|---|
bin | 101101011110011011011001… |
… | …110100001100000101101100 |
3 | 222020011002222000112122201220 |
4 | 231132123121310030011230 |
5 | 202203322322432124122 |
6 | 1545212053440103340 |
7 | 60061514205200622 |
oct | 5536333164140554 |
9 | 866132860478656 |
10 | 200003101442412 |
11 | 587aa92576a9a4 |
12 | 1a521b36004b50 |
13 | 877a2999a05c8 |
14 | 37562b78b5512 |
15 | 181c8164c025c |
hex | b5e6d9d0c16c |
200003101442412 has 96 divisors (see below), whose sum is σ = 486421392844800. Its totient is φ = 63882246624000.
The previous prime is 200003101442399. The next prime is 200003101442537. The reversal of 200003101442412 is 214244101300002.
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, 53959789 + ... + 57547067.
It is an arithmetic number, because the mean of its divisors is an integer number (5066889508800).
Almost surely, 2200003101442412 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 200003101442412, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (243210696422400).
200003101442412 is an abundant number, since it is smaller than the sum of its proper divisors (286418291402388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200003101442412 is a wasteful number, since it uses less digits than its factorization.
200003101442412 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3588527 (or 3588525 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 24.
Adding to 200003101442412 its reverse (214244101300002), we get a palindrome (414247202742414).
The spelling of 200003101442412 in words is "two hundred trillion, three billion, one hundred one million, four hundred forty-two thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •