Base | Representation |
---|---|
bin | 11110000000111001111… |
… | …010111100010100000110 |
3 | 21022011211002002200201020 |
4 | 132000321322330110012 |
5 | 232243103322223130 |
6 | 4215305234212010 |
7 | 302005030124400 |
oct | 36007172742406 |
9 | 7264732080636 |
10 | 2062556054790 |
11 | 7257a8138720 |
12 | 2938a1a24006 |
13 | 11c662718cca |
14 | 71b849c5b70 |
15 | 389b9d2ee10 |
hex | 1e039ebc506 |
2062556054790 has 192 divisors, whose sum is σ = 6288611074560. Its totient is φ = 428118620160.
The previous prime is 2062556054759. The next prime is 2062556054821. The reversal of 2062556054790 is 974506552602.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (2062556054759) and next prime (2062556054821).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 14953279 + ... + 15090581.
It is an arithmetic number, because the mean of its divisors is an integer number (32753182680).
Almost surely, 22062556054790 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2062556054790, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3144305537280).
2062556054790 is an abundant number, since it is smaller than the sum of its proper divisors (4226055019770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2062556054790 is a wasteful number, since it uses less digits than its factorization.
2062556054790 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 138267 (or 138260 counting only the distinct ones).
The product of its (nonzero) digits is 4536000, while the sum is 51.
The spelling of 2062556054790 in words is "two trillion, sixty-two billion, five hundred fifty-six million, fifty-four thousand, seven hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •