Base | Representation |
---|---|
bin | 10000000011010111001… |
… | …000101111110001010000 |
3 | 10220110100101211010002100 |
4 | 100003113020233301100 |
5 | 121033142440201112 |
6 | 2202433343520400 |
7 | 142461236656101 |
oct | 20032710576120 |
9 | 3813311733070 |
10 | 1103121022032 |
11 | 395916071047 |
12 | 159960bb9100 |
13 | 80040583983 |
14 | 3b569bb43a8 |
15 | 1da6499d2dc |
hex | 100d722fc50 |
1103121022032 has 60 divisors (see below), whose sum is σ = 3107651888224. Its totient is φ = 365271854400.
The previous prime is 1103121022019. The next prime is 1103121022093. The reversal of 1103121022032 is 2302201213011.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 1103121021996 and 1103121022014.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 25344358 + ... + 25387845.
Almost surely, 21103121022032 is an apocalyptic number.
1103121022032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1103121022032 is an abundant number, since it is smaller than the sum of its proper divisors (2004530866192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1103121022032 is a wasteful number, since it uses less digits than its factorization.
1103121022032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50732368 (or 50732359 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 1103121022032 its reverse (2302201213011), we get a palindrome (3405322235043).
The spelling of 1103121022032 in words is "one trillion, one hundred three billion, one hundred twenty-one million, twenty-two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •