Search a number
-
+
110132011201032 = 2334179976797213
BaseRepresentation
bin11001000010101000011011…
…011001111111001000001000
3112102221111222012220121220000
4121002220123121333020020
5103413400324331413112
61030121540354003000
732124526622310012
oct3102503331771010
9472844865817800
10110132011201032
11321007a6207437
12104283a3876460
13495b533a42772
141d2a5bc57d1b2
15caebbddec7dc
hex642a1b67f208

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".

Divisors: 1 2 3 4 6 8 9 12 18 24 27 36 54 72 81 108 162 179 216 324 358 537 648 716 1074 1432 1611 2148 3222 4296 4833 6444 9666 9767 12888 14499 19332 19534 28998 29301 38664 39068 57996 58602 78136 87903 97213 115992 117204 175806 194426 234408 263709 291639 351612 388852 527418 583278 703224 777704 791127 874917 1054836 1166556 1582254 1748293 1749834 2109672 2333112 2624751 3164508 3496586 3499668 5244879 5249502 6329016 6993172 6999336 7874253 10489758 10499004 13986344 15734637 15748506 17401127 20979516 20998008 31469274 31497012 34802254 41959032 47203911 52203381 62938548 62994024 69604508 94407822 104406762 125877096 139209016 141611733 156610143 188815644 208813524 283223466 313220286 377631288 417627048 469830429 566446932 626440572 939660858 949479371 1132893864 1252881144 1409491287 1879321716 1898958742 2818982574 2848438113 3758643432 3797917484 5637965148 5696876226 7595834968 8545314339 11275930296 11393752452 17090628678 22787504904 25635943017 34181257356 51271886034 68362514712 76907829051 102543772068 153815658102 169956807409 205087544136 307631316204 339913614818 509870422227 615262632408 679827229636 1019740844454 1359654459272 1529611266681 2039481688908 3059222533362 4078963377816 4588833800043 6118445066724 9177667600086 12236890133448 13766501400129 18355335200172 27533002800258 36710670400344 55066005600516 110132011201032