Base | Representation |
---|---|
bin | 101101100001010100101010… |
… | …010110100000000100000011 |
3 | 222020212010102001222202210110 |
4 | 231201110222112200010003 |
5 | 202220102214401010034 |
6 | 1545443312215002403 |
7 | 60112055500364535 |
oct | 5541245226400403 |
9 | 866763361882713 |
10 | 200202021110019 |
11 | 5887722272a405 |
12 | 1a5545ab969403 |
13 | 8792c7b236b36 |
14 | 3761b882d7855 |
15 | 1822aa9b95de9 |
hex | b6152a5a0103 |
200202021110019 has 16 divisors (see below), whose sum is σ = 279636170918400. Its totient is φ = 127234457759136.
The previous prime is 200202021110009. The next prime is 200202021110033. The reversal of 200202021110019 is 910011120202002.
It is not a de Polignac number, because 200202021110019 - 231 = 200199873626371 is a prime.
It is a super-2 number, since 2×2002020211100192 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 200202021109977 and 200202021110004.
It is not an unprimeable number, because it can be changed into a prime (200202021110009) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14564377029 + ... + 14564390774.
It is an arithmetic number, because the mean of its divisors is an integer number (17477260682400).
Almost surely, 2200202021110019 is an apocalyptic number.
200202021110019 is a gapful number since it is divisible by the number (29) formed by its first and last digit.
200202021110019 is a deficient number, since it is larger than the sum of its proper divisors (79434149808381).
200202021110019 is a wasteful number, since it uses less digits than its factorization.
200202021110019 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29128767914.
The product of its (nonzero) digits is 144, while the sum is 21.
The spelling of 200202021110019 in words is "two hundred trillion, two hundred two billion, twenty-one million, one hundred ten thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •