Base | Representation |
---|---|
bin | 1010010001110101000111… |
… | …0110111100010010101001 |
3 | 1111000101222020201202010012 |
4 | 2210131101312330102221 |
5 | 2440130313133004001 |
6 | 40011450100101305 |
7 | 2244334012442435 |
oct | 244352166742251 |
9 | 44011866652105 |
10 | 11301432313001 |
11 | 3667a01a05166 |
12 | 1326362994835 |
13 | 63c949c0613c |
14 | 2b0dc69db9c5 |
15 | 148e999922bb |
hex | a4751dbc4a9 |
11301432313001 has 8 divisors (see below), whose sum is σ = 11583796215264. Its totient is φ = 11019388373280.
The previous prime is 11301432312917. The next prime is 11301432313027. The reversal of 11301432313001 is 10031323410311.
11301432313001 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 not a de Polignac number, because 11301432313001 - 234 = 11284252443817 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11301432313901) 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, 79919111 + ... + 80060396.
It is an arithmetic number, because the mean of its divisors is an integer number (1447974526908).
Almost surely, 211301432313001 is an apocalyptic number.
It is an amenable number.
11301432313001 is a deficient number, since it is larger than the sum of its proper divisors (282363902263).
11301432313001 is a wasteful number, since it uses less digits than its factorization.
11301432313001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 159981271.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 11301432313001 its reverse (10031323410311), we get a palindrome (21332755723312).
The spelling of 11301432313001 in words is "eleven trillion, three hundred one billion, four hundred thirty-two million, three hundred thirteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •