Base | Representation |
---|---|
bin | 11001000010101000101101… |
… | …110100010110011010000101 |
3 | 112102221112202202011102101101 |
4 | 121002220231310112122011 |
5 | 103413401442421231041 |
6 | 1030122031150500101 |
7 | 32124540363031000 |
oct | 3102505564263205 |
9 | 472845682142341 |
10 | 110132320102021 |
11 | 32100944610308 |
12 | 1042846b204631 |
13 | 495b582a38b09 |
14 | 1d2a60b5cc537 |
15 | caebdb0b8b31 |
hex | 642a2dd16685 |
110132320102021 has 16 divisors (see below), whose sum is σ = 128453191574400. Its totient is φ = 94385167225440.
The previous prime is 110132320102009. The next prime is 110132320102031. The reversal of 110132320102021 is 120201023231011.
It is not a de Polignac number, because 110132320102021 - 215 = 110132320069253 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110132320102021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110132320102031) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21426391 + ... + 26064436.
It is an arithmetic number, because the mean of its divisors is an integer number (8028324473400).
Almost surely, 2110132320102021 is an apocalyptic number.
It is an amenable number.
110132320102021 is a deficient number, since it is larger than the sum of its proper divisors (18320871472379).
110132320102021 is an frugal number, since it uses more digits than its factorization.
110132320102021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47497609 (or 47497595 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 110132320102021 its reverse (120201023231011), we get a palindrome (230333343333032).
The spelling of 110132320102021 in words is "one hundred ten trillion, one hundred thirty-two billion, three hundred twenty million, one hundred two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •