Base | Representation |
---|---|
bin | 11000001000000111001100… |
… | …100111111000011100000101 |
3 | 111220201002000011100222121222 |
4 | 120020013030213320130011 |
5 | 102402004002103221113 |
6 | 1013402311532450125 |
7 | 31231144405461134 |
oct | 3010071447703405 |
9 | 456632004328558 |
10 | 106110600054533 |
11 | 308a0286484578 |
12 | ba98b41319945 |
13 | 47292570ba299 |
14 | 1c2bacd78391b |
15 | c402a837de08 |
hex | 6081cc9f8705 |
106110600054533 has 16 divisors (see below), whose sum is σ = 112884358536000. Its totient is φ = 99583514819712.
The previous prime is 106110600054469. The next prime is 106110600054581. The reversal of 106110600054533 is 335450006011601.
It is not a de Polignac number, because 106110600054533 - 26 = 106110600054469 is a prime.
It is a super-2 number, since 2×1061106000545332 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 106110600054493 and 106110600054502.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106110600654533) 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, 348256235 + ... + 348560792.
It is an arithmetic number, because the mean of its divisors is an integer number (7055272408500).
Almost surely, 2106110600054533 is an apocalyptic number.
It is an amenable number.
106110600054533 is a deficient number, since it is larger than the sum of its proper divisors (6773758481467).
106110600054533 is an equidigital number, since it uses as much as digits as its factorization.
106110600054533 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 696817204.
The product of its (nonzero) digits is 32400, while the sum is 35.
The spelling of 106110600054533 in words is "one hundred six trillion, one hundred ten billion, six hundred million, fifty-four thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •