Base | Representation |
---|---|
bin | 1011111111110110011101… |
… | …01101000101001110001101 |
3 | 10110102012112120121020111202 |
4 | 11333323032231011032031 |
5 | 11424230201201301042 |
6 | 132040131030355245 |
7 | 5362056140542211 |
oct | 577731655051615 |
9 | 113365476536452 |
10 | 26383157056397 |
11 | 8452041394a89 |
12 | 2b61295abbb25 |
13 | 1194bc868b43b |
14 | 672d47334941 |
15 | 30b446c15632 |
hex | 17feceb4538d |
26383157056397 has 8 divisors (see below), whose sum is σ = 26522224626744. Its totient is φ = 26244113891328.
The previous prime is 26383157056351. The next prime is 26383157056409. The reversal of 26383157056397 is 79365075138362.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 19923040201 + 26363234016196 = 141149^2 + 5134514^2 .
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 26383157056397 - 240 = 25283645428621 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26383157056327) 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, 3931508 + ... + 8259725.
It is an arithmetic number, because the mean of its divisors is an integer number (3315278078343).
Almost surely, 226383157056397 is an apocalyptic number.
It is an amenable number.
26383157056397 is a deficient number, since it is larger than the sum of its proper divisors (139067570347).
26383157056397 is a wasteful number, since it uses less digits than its factorization.
26383157056397 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12202639.
The product of its (nonzero) digits is 171460800, while the sum is 65.
The spelling of 26383157056397 in words is "twenty-six trillion, three hundred eighty-three billion, one hundred fifty-seven million, fifty-six thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •