Base | Representation |
---|---|
bin | 101101011110100001111011… |
… | …000001110101111111111100 |
3 | 222020011210000211200011122202 |
4 | 231132201323001311333330 |
5 | 202203431141341333040 |
6 | 1545215212203331032 |
7 | 60062152521401111 |
oct | 5536417301657774 |
9 | 866153024604582 |
10 | 200010101121020 |
11 | 58802897915053 |
12 | 1a52336a220a78 |
13 | 877ab43bc3178 |
14 | 375677d38a908 |
15 | 181cac5c74015 |
hex | b5e87b075ffc |
200010101121020 has 24 divisors (see below), whose sum is σ = 420030484815984. Its totient is φ = 80002274265216.
The previous prime is 200010101120989. The next prime is 200010101121041. The reversal of 200010101121020 is 20121101010002.
It is a junction number, because it is equal to n+sod(n) for n = 200010101120992 and 200010101121010.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 109457657 + ... + 111269936.
It is an arithmetic number, because the mean of its divisors is an integer number (17501270200666).
Almost surely, 2200010101121020 is an apocalyptic number.
200010101121020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200010101121020 is an abundant number, since it is smaller than the sum of its proper divisors (220020383694964).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200010101121020 is a wasteful number, since it uses less digits than its factorization.
200010101121020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 220772909 (or 220772907 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 200010101121020 its reverse (20121101010002), we get a palindrome (220131202131022).
The spelling of 200010101121020 in words is "two hundred trillion, ten billion, one hundred one million, one hundred twenty-one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •