Base | Representation |
---|---|
bin | 1010000010001001011111… |
… | …0100110110111100101101 |
3 | 1110001122120200000102122012 |
4 | 2200202113310312330231 |
5 | 2421222040421413201 |
6 | 35244012544331005 |
7 | 2216015551154531 |
oct | 240422764667455 |
9 | 43048520012565 |
10 | 11032023232301 |
11 | 3573722568355 |
12 | 12a20b6313a65 |
13 | 620413a08c16 |
14 | 2a1d4a5a5bc1 |
15 | 141e7cc345bb |
hex | a0897d36f2d |
11032023232301 has 8 divisors (see below), whose sum is σ = 11392083302400. Its totient is φ = 10672224934320.
The previous prime is 11032023232283. The next prime is 11032023232327. The reversal of 11032023232301 is 10323232023011.
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-11032023232301 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 (11032023232381) 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, 65357366 + ... + 65525943.
It is an arithmetic number, because the mean of its divisors is an integer number (1424010412800).
Almost surely, 211032023232301 is an apocalyptic number.
It is an amenable number.
11032023232301 is a deficient number, since it is larger than the sum of its proper divisors (360060070099).
11032023232301 is a wasteful number, since it uses less digits than its factorization.
11032023232301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130886059.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 11032023232301 its reverse (10323232023011), we get a palindrome (21355255255312).
The spelling of 11032023232301 in words is "eleven trillion, thirty-two billion, twenty-three million, two hundred thirty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •