Base | Representation |
---|---|
bin | 10111111000011010110100… |
… | …001010111011111101110001 |
3 | 111202212222100100000102110110 |
4 | 113320122310022323331301 |
5 | 102231321322133203241 |
6 | 1011215034402051533 |
7 | 31060215444113310 |
oct | 2770326412737561 |
9 | 452788310012413 |
10 | 105032153022321 |
11 | 30514982220258 |
12 | b943b27649ba9 |
13 | 467b6496660b5 |
14 | 1bd1824932277 |
15 | c221d9b57816 |
hex | 5f86b42bbf71 |
105032153022321 has 8 divisors (see below), whose sum is σ = 160048995081664. Its totient is φ = 60018373155600.
The previous prime is 105032153022319. The next prime is 105032153022373. The reversal of 105032153022321 is 123220351230501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 105032153022321 - 21 = 105032153022319 is a prime.
It is a super-3 number, since 3×1050321530223213 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105032153022301) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2500765548130 + ... + 2500765548171.
It is an arithmetic number, because the mean of its divisors is an integer number (20006124385208).
Almost surely, 2105032153022321 is an apocalyptic number.
It is an amenable number.
105032153022321 is a deficient number, since it is larger than the sum of its proper divisors (55016842059343).
105032153022321 is an equidigital number, since it uses as much as digits as its factorization.
105032153022321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5001531096311.
The product of its (nonzero) digits is 10800, while the sum is 30.
The spelling of 105032153022321 in words is "one hundred five trillion, thirty-two billion, one hundred fifty-three million, twenty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •