Base | Representation |
---|---|
bin | 11001000010001101101100… |
… | …010000111001010011110100 |
3 | 112102211202212111100222101110 |
4 | 121002031230100321103310 |
5 | 103412413031032020312 |
6 | 1030100431545355020 |
7 | 32122462326530544 |
oct | 3102155420712364 |
9 | 472752774328343 |
10 | 110103303001332 |
11 | 3209a604180063 |
12 | 10422911498a70 |
13 | 495890a1a4354 |
14 | 1d2905791d324 |
15 | cae08d8e443c |
hex | 64236c4394f4 |
110103303001332 has 48 divisors (see below), whose sum is σ = 256968946366272. Its totient is φ = 36692353240320.
The previous prime is 110103303001267. The next prime is 110103303001381. The reversal of 110103303001332 is 233100303301011.
It is a junction number, because it is equal to n+sod(n) for n = 110103303001299 and 110103303001308.
It is a congruent number.
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, 2206852107 + ... + 2206901997.
It is an arithmetic number, because the mean of its divisors is an integer number (5353519715964).
Almost surely, 2110103303001332 is an apocalyptic number.
110103303001332 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
110103303001332 is an abundant number, since it is smaller than the sum of its proper divisors (146865643364940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110103303001332 is a wasteful number, since it uses less digits than its factorization.
110103303001332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90048 (or 90046 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 110103303001332 its reverse (233100303301011), we get a palindrome (343203606302343).
The spelling of 110103303001332 in words is "one hundred ten trillion, one hundred three billion, three hundred three million, one thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •