Base | Representation |
---|---|
bin | 1010010011000101101010… |
… | …0111111010011001010101 |
3 | 1111002110210010010122020111 |
4 | 2210301122213322121111 |
5 | 2441004103334021001 |
6 | 40025423404203021 |
7 | 2246030560464124 |
oct | 244613247723125 |
9 | 44073703118214 |
10 | 11323054204501 |
11 | 36760979a8286 |
12 | 132a597b39471 |
13 | 6419b460cb90 |
14 | 2b2078475abb |
15 | 149812cd3851 |
hex | a4c5a9fa655 |
11323054204501 has 8 divisors (see below), whose sum is σ = 12202532375040. Its totient is φ = 10444786605552.
The previous prime is 11323054204499. The next prime is 11323054204523. The reversal of 11323054204501 is 10540245032311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11323054204501 - 21 = 11323054204499 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 (11323054204531) 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 7 ways as a sum of consecutive naturals, for example, 302623465 + ... + 302660878.
It is an arithmetic number, because the mean of its divisors is an integer number (1525316546880).
Almost surely, 211323054204501 is an apocalyptic number.
It is an amenable number.
11323054204501 is a deficient number, since it is larger than the sum of its proper divisors (879478170539).
11323054204501 is a wasteful number, since it uses less digits than its factorization.
11323054204501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 605285795.
The product of its (nonzero) digits is 14400, while the sum is 31.
Adding to 11323054204501 its reverse (10540245032311), we get a palindrome (21863299236812).
The spelling of 11323054204501 in words is "eleven trillion, three hundred twenty-three billion, fifty-four million, two hundred four thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •