Base | Representation |
---|---|
bin | 1100101001100000101110001… |
… | …1100011010101110011111110 |
3 | 11022201110120200111020100202200 |
4 | 3022120023203203111303332 |
5 | 1413130324324444433203 |
6 | 12433003100045132330 |
7 | 355323136512542130 |
oct | 31230134343256376 |
9 | 4281416614210680 |
10 | 890067070311678 |
11 | 23866a3632102a6 |
12 | 839b0b64b5a0a6 |
13 | 2c284c7026698c |
14 | 119b1694449050 |
15 | 6cd7a48de39a3 |
hex | 32982e38d5cfe |
890067070311678 has 384 divisors, whose sum is σ = 2455014757478400. Its totient is φ = 227294102052864.
The previous prime is 890067070311667. The next prime is 890067070311701. The reversal of 890067070311678 is 876113070760098.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 2013063526 + ... + 2013505622.
It is an arithmetic number, because the mean of its divisors is an integer number (6393267597600).
Almost surely, 2890067070311678 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 890067070311678, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1227507378739200).
890067070311678 is an abundant number, since it is smaller than the sum of its proper divisors (1564947687166722).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
890067070311678 is a wasteful number, since it uses less digits than its factorization.
890067070311678 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 442824 (or 442821 counting only the distinct ones).
The product of its (nonzero) digits is 21337344, while the sum is 63.
The spelling of 890067070311678 in words is "eight hundred ninety trillion, sixty-seven billion, seventy million, three hundred eleven thousand, six hundred seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •