Base | Representation |
---|---|
bin | 11110000110000001111… |
… | …010000011011100000000 |
3 | 21022201000120101111122100 |
4 | 132012001322003130000 |
5 | 232340341014424142 |
6 | 4222015244110400 |
7 | 302261265215610 |
oct | 36060172033400 |
9 | 7281016344570 |
10 | 2068058748672 |
11 | 728071282014 |
12 | 294978835400 |
13 | 12002b763ba7 |
14 | 72147740a40 |
15 | 38bdce82b4c |
hex | 1e181e83700 |
2068058748672 has 432 divisors, whose sum is σ = 7009601767168. Its totient is φ = 574105190400.
The previous prime is 2068058748671. The next prime is 2068058748703. The reversal of 2068058748672 is 2768478508602.
2068058748672 is a `hidden beast` number, since 2 + 0 + 6 + 8 + 0 + 5 + 87 + 486 + 72 = 666.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2068058748671) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 133838547 + ... + 133853997.
Almost surely, 22068058748672 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2068058748672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3504800883584).
2068058748672 is an abundant number, since it is smaller than the sum of its proper divisors (4941543018496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2068058748672 is a wasteful number, since it uses less digits than its factorization.
2068058748672 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15716 (or 15699 counting only the distinct ones).
The product of its (nonzero) digits is 72253440, while the sum is 63.
The spelling of 2068058748672 in words is "two trillion, sixty-eight billion, fifty-eight million, seven hundred forty-eight thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •