Base | Representation |
---|---|
bin | 1011111000111100110100… |
… | …10010011011010111111011 |
3 | 10102120112112111020000002012 |
4 | 11330132122102123113323 |
5 | 11411334104414441411 |
6 | 131335155343000135 |
7 | 5335663413632063 |
oct | 574363222332773 |
9 | 112515474200065 |
10 | 26146054452731 |
11 | 8370530126574 |
12 | 2b2334489904b |
13 | 1178740658615 |
14 | 6656937c03a3 |
15 | 3051bb33218b |
hex | 17c79a49b5fb |
26146054452731 has 8 divisors (see below), whose sum is σ = 26639926871184. Its totient is φ = 25652202428320.
The previous prime is 26146054452719. The next prime is 26146054452797. The reversal of 26146054452731 is 13725445064162.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 26146054452731 - 214 = 26146054436347 is a prime.
It is a super-2 number, since 2×261460544527312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 26146054452731.
It is not an unprimeable number, because it can be changed into a prime (26146054452131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2497796 + ... + 7650561.
It is an arithmetic number, because the mean of its divisors is an integer number (3329990858898).
Almost surely, 226146054452731 is an apocalyptic number.
26146054452731 is a deficient number, since it is larger than the sum of its proper divisors (493872418453).
26146054452731 is a wasteful number, since it uses less digits than its factorization.
26146054452731 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10197021.
The product of its (nonzero) digits is 4838400, while the sum is 50.
The spelling of 26146054452731 in words is "twenty-six trillion, one hundred forty-six billion, fifty-four million, four hundred fifty-two thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •