Base | Representation |
---|---|
bin | 1010001111001100011010… |
… | …1100111000100101011001 |
3 | 1110212002002022020210022211 |
4 | 2203303012230320211121 |
5 | 2433410042340023033 |
6 | 35535000351315121 |
7 | 2241141561046114 |
oct | 243630654704531 |
9 | 43762068223284 |
10 | 11256147970393 |
11 | 364a78409a327 |
12 | 131962521baa1 |
13 | 6385b1119b41 |
14 | 2acb2c6b357b |
15 | 147be90d92cd |
hex | a3cc6b38959 |
11256147970393 has 8 divisors (see below), whose sum is σ = 11873948505120. Its totient is φ = 10640884605120.
The previous prime is 11256147970367. The next prime is 11256147970439. The reversal of 11256147970393 is 39307974165211.
It is a happy number.
11256147970393 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11256147970393 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11256147970303) 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, 634283248 + ... + 634300993.
It is an arithmetic number, because the mean of its divisors is an integer number (1484243563140).
Almost surely, 211256147970393 is an apocalyptic number.
It is an amenable number.
11256147970393 is a deficient number, since it is larger than the sum of its proper divisors (617800534727).
11256147970393 is a wasteful number, since it uses less digits than its factorization.
11256147970393 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1268584727.
The product of its (nonzero) digits is 8573040, while the sum is 58.
The spelling of 11256147970393 in words is "eleven trillion, two hundred fifty-six billion, one hundred forty-seven million, nine hundred seventy thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •