Base | Representation |
---|---|
bin | 101001100101000001001… |
… | …010111001100010000000 |
3 | 101010011001102121121100000 |
4 | 221211001022321202000 |
5 | 333303120114043333 |
6 | 10024333451200000 |
7 | 413300143421055 |
oct | 51450112714200 |
9 | 11104042547300 |
10 | 2857246627968 |
11 | a0182a262467 |
12 | 3a1906146000 |
13 | 17958b6b82b5 |
14 | 9c411b4102c |
15 | 4e4cbe48713 |
hex | 299412b9880 |
2857246627968 has 768 divisors, whose sum is σ = 9332865360000. Its totient is φ = 866675884032.
The previous prime is 2857246627931. The next prime is 2857246627973. The reversal of 2857246627968 is 8697266427582.
2857246627968 is a `hidden beast` number, since 2 + 8 + 5 + 72 + 466 + 2 + 7 + 96 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (72).
It is a junction number, because it is equal to n+sod(n) for n = 2857246627896 and 2857246627905.
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, 5021522788 + ... + 5021523356.
Almost surely, 22857246627968 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 2857246627968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4666432680000).
2857246627968 is an abundant number, since it is smaller than the sum of its proper divisors (6475618732032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2857246627968 is a wasteful number, since it uses less digits than its factorization.
2857246627968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 939 (or 915 counting only the distinct ones).
The product of its digits is 975421440, while the sum is 72.
The spelling of 2857246627968 in words is "two trillion, eight hundred fifty-seven billion, two hundred forty-six million, six hundred twenty-seven thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •