Base | Representation |
---|---|
bin | 1010001101110010100000… |
… | …1010011011000110100101 |
3 | 1110202202210022121111202112 |
4 | 2203130220022123012211 |
5 | 2433011130401101013 |
6 | 35515525441450405 |
7 | 2236325521534013 |
oct | 243345012330645 |
9 | 43682708544675 |
10 | 11232013300133 |
11 | 364051976534a |
12 | 1314a0a640a05 |
13 | 636235c5b372 |
14 | 2ab8bd21d8b3 |
15 | 147285395ba8 |
hex | a372829b1a5 |
11232013300133 has 8 divisors (see below), whose sum is σ = 11580957443616. Its totient is φ = 10887057090000.
The previous prime is 11232013300063. The next prime is 11232013300171. The reversal of 11232013300133 is 33100331023211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11232013300133 - 28 = 11232013299877 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11232013300099 and 11232013300108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11232013308133) 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, 996977618 + ... + 996988883.
It is an arithmetic number, because the mean of its divisors is an integer number (1447619680452).
Almost surely, 211232013300133 is an apocalyptic number.
It is an amenable number.
11232013300133 is a deficient number, since it is larger than the sum of its proper divisors (348944143483).
11232013300133 is a wasteful number, since it uses less digits than its factorization.
11232013300133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1993966675.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 11232013300133 its reverse (33100331023211), we get a palindrome (44332344323344).
The spelling of 11232013300133 in words is "eleven trillion, two hundred thirty-two billion, thirteen million, three hundred thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •