Base | Representation |
---|---|
bin | 11000000100101011001… |
… | …11110001000000000000 |
3 | 2221002000002021021202120 |
4 | 30002111213301000000 |
5 | 102022442322402321 |
6 | 1431552405244240 |
7 | 113521253400324 |
oct | 14022547610000 |
9 | 2832002237676 |
10 | 827143950336 |
11 | 299876218400 |
12 | 114380a03680 |
13 | 5cccb71b652 |
14 | 2c069359984 |
15 | 167b130dec6 |
hex | c0959f1000 |
827143950336 has 312 divisors, whose sum is σ = 2507892858240. Its totient is φ = 241993973760.
The previous prime is 827143950253. The next prime is 827143950341. The reversal of 827143950336 is 633059341728.
It is a super-2 number, since 2×8271439503362 (a number of 25 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 43109001 + ... + 43128183.
It is a 1-persistent number, because it is pandigital, but 2⋅827143950336 = 1654287900672 is not.
Almost surely, 2827143950336 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 827143950336, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1253946429120).
827143950336 is an abundant number, since it is smaller than the sum of its proper divisors (1680748907904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
827143950336 is a wasteful number, since it uses less digits than its factorization.
827143950336 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19261 (or 19228 counting only the distinct ones).
The product of its (nonzero) digits is 3265920, while the sum is 51.
The spelling of 827143950336 in words is "eight hundred twenty-seven billion, one hundred forty-three million, nine hundred fifty thousand, three hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •