Base | Representation |
---|---|
bin | 11110100001011010111001… |
… | …10100010000110010011000 |
3 | 22210122111220021210202011210 |
4 | 33100231130310100302120 |
5 | 32244134213322414322 |
6 | 354430014213423120 |
7 | 20065121444251551 |
oct | 1720553464206230 |
9 | 283574807722153 |
10 | 67119011138712 |
11 | 1a428015aa9435 |
12 | 764014503aaa0 |
13 | 2b5b3ac553c50 |
14 | 1280812827328 |
15 | 7b5dbd52670c |
hex | 3d0b5cd10c98 |
67119011138712 has 128 divisors (see below), whose sum is σ = 184914078370560. Its totient is φ = 20171003650560.
The previous prime is 67119011138653. The next prime is 67119011138713. The reversal of 67119011138712 is 21783111091176.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (67119011138713) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 466093762 + ... + 466237742.
It is an arithmetic number, because the mean of its divisors is an integer number (1444641237270).
Almost surely, 267119011138712 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 67119011138712, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (92457039185280).
67119011138712 is an abundant number, since it is smaller than the sum of its proper divisors (117795067231848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
67119011138712 is a wasteful number, since it uses less digits than its factorization.
67119011138712 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 178793 (or 178789 counting only the distinct ones).
The product of its (nonzero) digits is 127008, while the sum is 48.
The spelling of 67119011138712 in words is "sixty-seven trillion, one hundred nineteen billion, eleven million, one hundred thirty-eight thousand, seven hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •