Base | Representation |
---|---|
bin | 11000001000000111001100… |
… | …100111111000011100001001 |
3 | 111220201002000011100222122010 |
4 | 120020013030213320130021 |
5 | 102402004002103221122 |
6 | 1013402311532450133 |
7 | 31231144405461141 |
oct | 3010071447703411 |
9 | 456632004328563 |
10 | 106110600054537 |
11 | 308a0286484581 |
12 | ba98b41319949 |
13 | 47292570ba2a0 |
14 | 1c2bacd783921 |
15 | c402a837de0c |
hex | 6081cc9f8709 |
106110600054537 has 32 divisors (see below), whose sum is σ = 160491242598400. Its totient is φ = 61820335467072.
The previous prime is 106110600054469. The next prime is 106110600054581. The reversal of 106110600054537 is 735450006011601.
It is not a de Polignac number, because 106110600054537 - 222 = 106110595860233 is a prime.
It is a super-2 number, since 2×1061106000545372 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 106110600054495 and 106110600054504.
It is not an unprimeable number, because it can be changed into a prime (106110600054737) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 47181337 + ... + 49379142.
It is an arithmetic number, because the mean of its divisors is an integer number (5015351331200).
Almost surely, 2106110600054537 is an apocalyptic number.
It is an amenable number.
106110600054537 is a deficient number, since it is larger than the sum of its proper divisors (54380642543863).
106110600054537 is a wasteful number, since it uses less digits than its factorization.
106110600054537 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 96561997.
The product of its (nonzero) digits is 75600, while the sum is 39.
The spelling of 106110600054537 in words is "one hundred six trillion, one hundred ten billion, six hundred million, fifty-four thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •