Base | Representation |
---|---|
bin | 1011111000110110100110… |
… | …10001001010101011110000 |
3 | 10102120012220210022101222111 |
4 | 11330123103101022223300 |
5 | 11411310240124044430 |
6 | 131333444144415104 |
7 | 5335514600631325 |
oct | 574332321125360 |
9 | 112505823271874 |
10 | 26142715456240 |
11 | 836a077377039 |
12 | 2b22772617494 |
13 | 117832a971456 |
14 | 665458172b4c |
15 | 305073129c2a |
hex | 17c6d344aaf0 |
26142715456240 has 40 divisors (see below), whose sum is σ = 61778236618368. Its totient is φ = 10285658538240.
The previous prime is 26142715456217. The next prime is 26142715456241. The reversal of 26142715456240 is 4265451724162.
It is a tau number, because it is divible by the number of its divisors (40).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26142715456241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2678552032 + ... + 2678561791.
Almost surely, 226142715456240 is an apocalyptic number.
26142715456240 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
26142715456240 is an abundant number, since it is smaller than the sum of its proper divisors (35635521162128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26142715456240 is a wasteful number, since it uses less digits than its factorization.
26142715456240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5357113897 (or 5357113891 counting only the distinct ones).
The product of its (nonzero) digits is 3225600, while the sum is 49.
The spelling of 26142715456240 in words is "twenty-six trillion, one hundred forty-two billion, seven hundred fifteen million, four hundred fifty-six thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •