Base | Representation |
---|---|
bin | 1010010111111110010000… |
… | …0110011111100100010101 |
3 | 1111101111101000020200111221 |
4 | 2211333210012133210111 |
5 | 2443342431030001133 |
6 | 40132142025330341 |
7 | 2255061141236131 |
oct | 245774406374425 |
9 | 44344330220457 |
10 | 11406965078293 |
11 | 36a8737453764 |
12 | 13428b56369b1 |
13 | 649897a5c0a5 |
14 | 2b61587a43c1 |
15 | 14bac47bea2d |
hex | a5fe419f915 |
11406965078293 has 8 divisors (see below), whose sum is σ = 11599764512000. Its totient is φ = 11214352741680.
The previous prime is 11406965078291. The next prime is 11406965078317. The reversal of 11406965078293 is 39287056960411.
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 11406965078293 - 21 = 11406965078291 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (61).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11406965078291) 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, 46651305 + ... + 46895182.
It is an arithmetic number, because the mean of its divisors is an integer number (1449970564000).
It is a 1-persistent number, because it is pandigital, but 2⋅11406965078293 = 22813930156586 is not.
Almost surely, 211406965078293 is an apocalyptic number.
It is an amenable number.
11406965078293 is a deficient number, since it is larger than the sum of its proper divisors (192799433707).
11406965078293 is an equidigital number, since it uses as much as digits as its factorization.
11406965078293 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 93548547.
The product of its (nonzero) digits is 19595520, while the sum is 61.
The spelling of 11406965078293 in words is "eleven trillion, four hundred six billion, nine hundred sixty-five million, seventy-eight thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •