Base | Representation |
---|---|
bin | 1010001101101111111001… |
… | …0000101100001101101010 |
3 | 1110202200222022210101212221 |
4 | 2203123332100230031222 |
5 | 2433003210414100020 |
6 | 35515332010024254 |
7 | 2236302224245663 |
oct | 243337620541552 |
9 | 43680868711787 |
10 | 11231310300010 |
11 | 3640198956a09 |
12 | 131485311808a |
13 | 63615340b568 |
14 | 2ab853b0436a |
15 | 1472437ce6aa |
hex | a36fe42c36a |
11231310300010 has 32 divisors (see below), whose sum is σ = 20264824499472. Its totient is φ = 4481755729920.
The previous prime is 11231310299953. The next prime is 11231310300011. The reversal of 11231310300010 is 1000301313211.
It can be written as a sum of positive squares in 8 ways, for example, as 7212323822929 + 4018986477081 = 2685577^2 + 2004741^2 .
It is a super-2 number, since 2×112313103000102 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11231310300011) 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 15 ways as a sum of consecutive naturals, for example, 52029822 + ... + 52245238.
Almost surely, 211231310300010 is an apocalyptic number.
11231310300010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11231310300010 is a deficient number, since it is larger than the sum of its proper divisors (9033514199462).
11231310300010 is a wasteful number, since it uses less digits than its factorization.
11231310300010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 227898.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 11231310300010 its reverse (1000301313211), we get a palindrome (12231611613221).
The spelling of 11231310300010 in words is "eleven trillion, two hundred thirty-one billion, three hundred ten million, three hundred thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •