Base | Representation |
---|---|
bin | 10000001010101110001… |
… | …001010001110000110000 |
3 | 10221012202010012212112112 |
4 | 100022232021101300300 |
5 | 121200333421330000 |
6 | 2210221431344452 |
7 | 143161122431225 |
oct | 20125611216060 |
9 | 3835663185475 |
10 | 1111023230000 |
11 | 399200715932 |
12 | 15b3a7522128 |
13 | 809cc777288 |
14 | 3bab94a394c |
15 | 1dd785cd235 |
hex | 102ae251c30 |
1111023230000 has 100 divisors (see below), whose sum is σ = 2716533468528. Its totient is φ = 440008800000.
The previous prime is 1111023229991. The next prime is 1111023230039. The reversal of 1111023230000 is 323201111.
It is a tau number, because it is divible by the number of its divisors (100).
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 459989 + ... + 1560011.
Almost surely, 21111023230000 is an apocalyptic number.
1111023230000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1111023230000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1358266734264).
1111023230000 is an abundant number, since it is smaller than the sum of its proper divisors (1605510238528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1111023230000 is a wasteful number, since it uses less digits than its factorization.
1111023230000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1100152 (or 1100131 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 1111023230000 its reverse (323201111), we get a palindrome (1111346431111).
The spelling of 1111023230000 in words is "one trillion, one hundred eleven billion, twenty-three million, two hundred thirty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •