Base | Representation |
---|---|
bin | 11001000010001100100101… |
… | …001110001001110011100100 |
3 | 112102211122210102121010022120 |
4 | 121002030211032021303210 |
5 | 103412403110420201012 |
6 | 1030100113411025540 |
7 | 32122420644533124 |
oct | 3102144516116344 |
9 | 472748712533276 |
10 | 110102111100132 |
11 | 3209a0523a6048 |
12 | 1042263a29b2b0 |
13 | 495877a287278 |
14 | 1d28d834dac84 |
15 | cae01de5858c |
hex | 642325389ce4 |
110102111100132 has 96 divisors (see below), whose sum is σ = 284639900936832. Its totient is φ = 32974157039616.
The previous prime is 110102111100131. The next prime is 110102111100139. The reversal of 110102111100132 is 231001111201011.
It is not an unprimeable number, because it can be changed into a prime (110102111100131) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 137212458 + ... + 138012545.
It is an arithmetic number, because the mean of its divisors is an integer number (2964998968092).
Almost surely, 2110102111100132 is an apocalyptic number.
110102111100132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
110102111100132 is an abundant number, since it is smaller than the sum of its proper divisors (174537789836700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110102111100132 is a wasteful number, since it uses less digits than its factorization.
110102111100132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 275225117 (or 275225115 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 15.
Adding to 110102111100132 its reverse (231001111201011), we get a palindrome (341103222301143).
The spelling of 110102111100132 in words is "one hundred ten trillion, one hundred two billion, one hundred eleven million, one hundred thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •