Base | Representation |
---|---|
bin | 101101011111110110100101… |
… | …100111101101000001010000 |
3 | 222020111110200102202211002121 |
4 | 231133312211213231001100 |
5 | 202211423332030031000 |
6 | 1545325045052224024 |
7 | 60101551365212332 |
oct | 5537664547550120 |
9 | 866443612684077 |
10 | 200101010002000 |
11 | 588383a8583948 |
12 | 1a538abb46b014 |
13 | 87865a10cb233 |
14 | 375ad24c77452 |
15 | 1820146cd3b1a |
hex | b5fda59ed050 |
200101010002000 has 80 divisors (see below), whose sum is σ = 486517415673744. Its totient is φ = 79598191680000.
The previous prime is 200101010001917. The next prime is 200101010002021. The reversal of 200101010002000 is 200010101002.
It can be written as a sum of positive squares in 8 ways, for example, as 171759057953344 + 28341952048656 = 13105688^2 + 5323716^2 .
It is a tau number, because it is divible by the number of its divisors (80).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 276020611 + ... + 276744610.
Almost surely, 2200101010002000 is an apocalyptic number.
200101010002000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200101010002000 is an abundant number, since it is smaller than the sum of its proper divisors (286416405671744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200101010002000 is a wasteful number, since it uses less digits than its factorization.
200101010002000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 552765425 (or 552765409 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 7.
Adding to 200101010002000 its reverse (200010101002), we get a palindrome (200301020103002).
The spelling of 200101010002000 in words is "two hundred trillion, one hundred one billion, ten million, two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •