Base | Representation |
---|---|
bin | 11110111001000010101011… |
… | …011110011101000100000000 |
3 | 122211001012201100220100021120 |
4 | 132321002223132131010000 |
5 | 120301422401243104433 |
6 | 1200541451141152240 |
7 | 40421440142056506 |
oct | 3671025336350400 |
9 | 584035640810246 |
10 | 135861282394368 |
11 | 3a3204a00193a3 |
12 | 132a29b06bb680 |
13 | 5aa688293561b |
14 | 2579a14bba676 |
15 | 10a90e51c37b3 |
hex | 7b90ab79d100 |
135861282394368 has 288 divisors, whose sum is σ = 380795433984000. Its totient is φ = 42919809343488.
The previous prime is 135861282394333. The next prime is 135861282394379. The reversal of 135861282394368 is 863493282168531.
It is a Harshad number since it is a multiple of its sum of digits (69).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 840036646 + ... + 840198362.
It is an arithmetic number, because the mean of its divisors is an integer number (1322206368000).
Almost surely, 2135861282394368 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 135861282394368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (190397716992000).
135861282394368 is an abundant number, since it is smaller than the sum of its proper divisors (244934151589632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135861282394368 is a wasteful number, since it uses less digits than its factorization.
135861282394368 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 162197 (or 162183 counting only the distinct ones).
The product of its digits is 358318080, while the sum is 69.
The spelling of 135861282394368 in words is "one hundred thirty-five trillion, eight hundred sixty-one billion, two hundred eighty-two million, three hundred ninety-four thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •