Base | Representation |
---|---|
bin | 11001000010101000011011… |
… | …011001111111001000001000 |
3 | 112102221111222012220121220000 |
4 | 121002220123121333020020 |
5 | 103413400324331413112 |
6 | 1030121540354003000 |
7 | 32124526622310012 |
oct | 3102503331771010 |
9 | 472844865817800 |
10 | 110132011201032 |
11 | 321007a6207437 |
12 | 104283a3876460 |
13 | 495b533a42772 |
14 | 1d2a5bc57d1b2 |
15 | caebbddec7dc |
hex | 642a1b67f208 |
110132011201032 has 160 divisors (see below), whose sum is σ = 310229861198400. Its totient is φ = 36501469727616.
The previous prime is 110132011200973. The next prime is 110132011201073. The reversal of 110132011201032 is 230102110231011.
110132011201032 is a `hidden beast` number, since 1 + 101 + 320 + 11 + 201 + 0 + 32 = 666.
It is a super-2 number, since 2×1101320112010322 (a number of 29 digits) contains 22 as substring.
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 = 110132011200996 and 110132011201014.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 1132845258 + ... + 1132942470.
It is an arithmetic number, because the mean of its divisors is an integer number (1938936632490).
Almost surely, 2110132011201032 is an apocalyptic number.
110132011201032 is a gapful number since it is divisible by the number (12) 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 110132011201032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (155114930599200).
110132011201032 is an abundant number, since it is smaller than the sum of its proper divisors (200097849997368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110132011201032 is a wasteful number, since it uses less digits than its factorization.
110132011201032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107177 (or 107164 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 110132011201032 its reverse (230102110231011), we get a palindrome (340234121432043).
The spelling of 110132011201032 in words is "one hundred ten trillion, one hundred thirty-two billion, eleven million, two hundred one thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •