Base | Representation |
---|---|
bin | 11101000110101111010… |
… | …011110101011100000110 |
3 | 21002012121110220102212022 |
4 | 131012233103311130012 |
5 | 230232201324130222 |
6 | 4130500025523142 |
7 | 264334240014326 |
oct | 35065723653406 |
9 | 7065543812768 |
10 | 2000101005062 |
11 | 701268969446 |
12 | 2837719434b2 |
13 | 1167bb46a494 |
14 | 6cb3c063286 |
15 | 37061cd0042 |
hex | 1d1af4f5706 |
2000101005062 has 4 divisors (see below), whose sum is σ = 3000151507596. Its totient is φ = 1000050502530.
The previous prime is 2000101005059. The next prime is 2000101005079. The reversal of 2000101005062 is 2605001010002.
It is a semiprime because it is the product of two primes.
It is a self number, because there is not a number n which added to its sum of digits gives 2000101005062.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500025251264 + ... + 500025251267.
It is an arithmetic number, because the mean of its divisors is an integer number (750037876899).
Almost surely, 22000101005062 is an apocalyptic number.
2000101005062 is a deficient number, since it is larger than the sum of its proper divisors (1000050502534).
2000101005062 is a wasteful number, since it uses less digits than its factorization.
2000101005062 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1000050502533.
The product of its (nonzero) digits is 120, while the sum is 17.
Adding to 2000101005062 its reverse (2605001010002), we get a palindrome (4605102015064).
The spelling of 2000101005062 in words is "two trillion, one hundred one million, five thousand, sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •