Base | Representation |
---|---|
bin | 1010010011100011010101… |
… | …1110111000000000001100 |
3 | 1111010020100100002102222002 |
4 | 2210320311132320000030 |
5 | 2441121412334404004 |
6 | 40033222120411432 |
7 | 2246432156314100 |
oct | 244706536700014 |
9 | 44106310072862 |
10 | 11331021013004 |
11 | 3679505a65440 |
12 | 1330040016b78 |
13 | 642684001454 |
14 | 2b25d257d900 |
15 | 149b2c42461e |
hex | a4e357b800c |
11331021013004 has 72 divisors (see below), whose sum is σ = 25539273893952. Its totient is φ = 4348792657440.
The previous prime is 11331021013003. The next prime is 11331021013087. The reversal of 11331021013004 is 40031012013311.
It is not an unprimeable number, because it can be changed into a prime (11331021013003) 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 23 ways as a sum of consecutive naturals, for example, 39076262 + ... + 39365165.
It is an arithmetic number, because the mean of its divisors is an integer number (354712137416).
Almost surely, 211331021013004 is an apocalyptic number.
11331021013004 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
11331021013004 is an abundant number, since it is smaller than the sum of its proper divisors (14208252880948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11331021013004 is a wasteful number, since it uses less digits than its factorization.
11331021013004 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78441523 (or 78441514 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 11331021013004 its reverse (40031012013311), we get a palindrome (51362033026315).
The spelling of 11331021013004 in words is "eleven trillion, three hundred thirty-one billion, twenty-one million, thirteen thousand, four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •