Base | Representation |
---|---|
bin | 10000000001101010101… |
… | …110100111100000101100 |
3 | 10220021122122110001202111 |
4 | 100001222232213200230 |
5 | 121020431332430012 |
6 | 2201533052533404 |
7 | 142365203345413 |
oct | 20015256474054 |
9 | 3807578401674 |
10 | 1101302233132 |
11 | 395072444022 |
12 | 159533a81264 |
13 | 7cb1081581a |
14 | 3b43640a47a |
15 | 1d9a9e82ba7 |
hex | 1006aba782c |
1101302233132 has 48 divisors (see below), whose sum is σ = 2053963779840. Its totient is φ = 515181788352.
The previous prime is 1101302233127. The next prime is 1101302233139. The reversal of 1101302233132 is 2313322031011.
It is a super-3 number, since 3×11013022331323 (a number of 37 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (1101302233139) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 16664298 + ... + 16730254.
It is an arithmetic number, because the mean of its divisors is an integer number (42790912080).
Almost surely, 21101302233132 is an apocalyptic number.
It is an amenable number.
1101302233132 is a deficient number, since it is larger than the sum of its proper divisors (952661546708).
1101302233132 is a wasteful number, since it uses less digits than its factorization.
1101302233132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68710 (or 68708 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 1101302233132 its reverse (2313322031011), we get a palindrome (3414624264143).
The spelling of 1101302233132 in words is "one trillion, one hundred one billion, three hundred two million, two hundred thirty-three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •