Base | Representation |
---|---|
bin | 1100000000000011011111… |
… | …00001000110100010101111 |
3 | 10110102212120221002100112010 |
4 | 12000001233201012202233 |
5 | 11424334011400441101 |
6 | 132043244554012303 |
7 | 5362424342654106 |
oct | 600015741064257 |
9 | 113385527070463 |
10 | 26390150015151 |
11 | 8454aaa76a43a |
12 | 2b62707a17093 |
13 | 119577139a460 |
14 | 67340bd7b03d |
15 | 30b705add2d6 |
hex | 18006f8468af |
26390150015151 has 32 divisors (see below), whose sum is σ = 38929275931392. Its totient is φ = 15799218624000.
The previous prime is 26390150015147. The next prime is 26390150015171. The reversal of 26390150015151 is 15151005109362.
It is not a de Polignac number, because 26390150015151 - 22 = 26390150015147 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26390150015171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 30926730 + ... + 31768583.
It is an arithmetic number, because the mean of its divisors is an integer number (1216539872856).
Almost surely, 226390150015151 is an apocalyptic number.
26390150015151 is a deficient number, since it is larger than the sum of its proper divisors (12539125916241).
26390150015151 is a wasteful number, since it uses less digits than its factorization.
26390150015151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62695623.
The product of its (nonzero) digits is 40500, while the sum is 39.
The spelling of 26390150015151 in words is "twenty-six trillion, three hundred ninety billion, one hundred fifty million, fifteen thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •