Base | Representation |
---|---|
bin | 1011110110000011001111… |
… | …11110100000010011000101 |
3 | 10102020000101012221101102020 |
4 | 11323001213332200103011 |
5 | 11403221040041341123 |
6 | 131221321334033353 |
7 | 5325535502036535 |
oct | 573014776402305 |
9 | 112200335841366 |
10 | 26046426121413 |
11 | 8332255575675 |
12 | 2b07b7b4a8859 |
13 | 116c223b4ab99 |
14 | 660921c6b4c5 |
15 | 3027d9a617e3 |
hex | 17b067fa04c5 |
26046426121413 has 8 divisors (see below), whose sum is σ = 35467473867648. Its totient is φ = 16994831228064.
The previous prime is 26046426121369. The next prime is 26046426121451. The reversal of 26046426121413 is 31412162464062.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 26046426121413 - 26 = 26046426121349 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26046426121013) 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, 92363213056 + ... + 92363213337.
It is an arithmetic number, because the mean of its divisors is an integer number (4433434233456).
Almost surely, 226046426121413 is an apocalyptic number.
It is an amenable number.
26046426121413 is a deficient number, since it is larger than the sum of its proper divisors (9421047746235).
26046426121413 is a wasteful number, since it uses less digits than its factorization.
26046426121413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 184726426443.
The product of its (nonzero) digits is 331776, while the sum is 42.
Adding to 26046426121413 its reverse (31412162464062), we get a palindrome (57458588585475).
The spelling of 26046426121413 in words is "twenty-six trillion, forty-six billion, four hundred twenty-six million, one hundred twenty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •