Base | Representation |
---|---|
bin | 10111011001110000010… |
… | …01111000110010100101 |
3 | 2211212112011220010212202 |
4 | 23230320021320302211 |
5 | 101133244324002412 |
6 | 1413222055024245 |
7 | 112044241505204 |
oct | 13547011706245 |
9 | 2755464803782 |
10 | 804101000357 |
11 | 290021062a96 |
12 | 10ba0b96b085 |
13 | 5aa987a1cc5 |
14 | 2acc0c8b23b |
15 | 15db33683c2 |
hex | bb38278ca5 |
804101000357 has 8 divisors (see below), whose sum is σ = 866128427520. Its totient is φ = 744329116080.
The previous prime is 804101000327. The next prime is 804101000359. The reversal of 804101000357 is 753000101408.
804101000357 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-804101000357 is a prime.
It is a super-2 number, since 2×8041010003572 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (804101000359) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 563884982 + ... + 563886407.
It is an arithmetic number, because the mean of its divisors is an integer number (108266053440).
Almost surely, 2804101000357 is an apocalyptic number.
It is an amenable number.
804101000357 is a deficient number, since it is larger than the sum of its proper divisors (62027427163).
804101000357 is a wasteful number, since it uses less digits than its factorization.
804101000357 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1127771443.
The product of its (nonzero) digits is 3360, while the sum is 29.
The spelling of 804101000357 in words is "eight hundred four billion, one hundred one million, three hundred fifty-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •