Base | Representation |
---|---|
bin | 1010010011100100100000… |
… | …0001111101101001000110 |
3 | 1111010021011000122102200112 |
4 | 2210321020001331221012 |
5 | 2441123032020413110 |
6 | 40033313034313022 |
7 | 2246442655341602 |
oct | 244711001755106 |
9 | 44107130572615 |
10 | 11331332201030 |
11 | 3679655690626 |
12 | 1330108288772 |
13 | 64270361878a |
14 | 2b2621a26502 |
15 | 149b498e3405 |
hex | a4e4807da46 |
11331332201030 has 16 divisors (see below), whose sum is σ = 20830363876800. Its totient is φ = 4436096010432.
The previous prime is 11331332201027. The next prime is 11331332201039. The reversal of 11331332201030 is 3010223313311.
It is a junction number, because it is equal to n+sod(n) for n = 11331332200987 and 11331332201005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11331332201039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12054608255 + ... + 12054609194.
It is an arithmetic number, because the mean of its divisors is an integer number (1301897742300).
Almost surely, 211331332201030 is an apocalyptic number.
11331332201030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11331332201030 is a deficient number, since it is larger than the sum of its proper divisors (9499031675770).
11331332201030 is a wasteful number, since it uses less digits than its factorization.
11331332201030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24109217503.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 11331332201030 its reverse (3010223313311), we get a palindrome (14341555514341).
The spelling of 11331332201030 in words is "eleven trillion, three hundred thirty-one billion, three hundred thirty-two million, two hundred one thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •