Base | Representation |
---|---|
bin | 1010000111111011000100… |
… | …0101010110001111101000 |
3 | 1110102010122122101001002110 |
4 | 2201332301011112033220 |
5 | 2424333230143424000 |
6 | 35401341140202320 |
7 | 2226130200231264 |
oct | 241766105261750 |
9 | 43363578331073 |
10 | 11131231233000 |
11 | 360180192767a |
12 | 12b93829993a0 |
13 | 629894407308 |
14 | 2a6a7c3810a4 |
15 | 144837677850 |
hex | a1fb11563e8 |
11131231233000 has 64 divisors (see below), whose sum is σ = 34729441456320. Its totient is φ = 2968328328000.
The previous prime is 11131231232971. The next prime is 11131231233053. The reversal of 11131231233000 is 33213213111.
It is a happy number.
11131231233000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1855202206 + ... + 1855208205.
It is an arithmetic number, because the mean of its divisors is an integer number (542647522755).
Almost surely, 211131231233000 is an apocalyptic number.
11131231233000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11131231233000 is an abundant number, since it is smaller than the sum of its proper divisors (23598210223320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11131231233000 is a wasteful number, since it uses less digits than its factorization.
11131231233000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3710410435 (or 3710410421 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 11131231233000 its reverse (33213213111), we get a palindrome (11164444446111).
The spelling of 11131231233000 in words is "eleven trillion, one hundred thirty-one billion, two hundred thirty-one million, two hundred thirty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •