Base | Representation |
---|---|
bin | 1010010001110100101101… |
… | …1010111100011001101001 |
3 | 1111000101200201111122000112 |
4 | 2210131023122330121221 |
5 | 2440130103010410441 |
6 | 40011431241144105 |
7 | 2244331231436306 |
oct | 244351332743151 |
9 | 44011621448015 |
10 | 11301324310121 |
11 | 3667956a47a8a |
12 | 132633278b035 |
13 | 63c93071cb01 |
14 | 2b0db65260ad |
15 | 148e9025b4eb |
hex | a474b6bc669 |
11301324310121 has 16 divisors (see below), whose sum is σ = 11839115343744. Its totient is φ = 10767406239744.
The previous prime is 11301324310037. The next prime is 11301324310163. The reversal of 11301324310121 is 12101342310311.
It is a cyclic number.
It is not a de Polignac number, because 11301324310121 - 210 = 11301324309097 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11301324310181) 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 15 ways as a sum of consecutive naturals, for example, 238940351 + ... + 238987643.
It is an arithmetic number, because the mean of its divisors is an integer number (739944708984).
Almost surely, 211301324310121 is an apocalyptic number.
It is an amenable number.
11301324310121 is a deficient number, since it is larger than the sum of its proper divisors (537791033623).
11301324310121 is a wasteful number, since it uses less digits than its factorization.
11301324310121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88000.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 11301324310121 its reverse (12101342310311), we get a palindrome (23402666620432).
The spelling of 11301324310121 in words is "eleven trillion, three hundred one billion, three hundred twenty-four million, three hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •