Base | Representation |
---|---|
bin | 11000000111000001001110… |
… | …101010001001010011011101 |
3 | 111220102220002101012100011001 |
4 | 120013001032222021103131 |
5 | 102344241121400242103 |
6 | 1013304005023430301 |
7 | 31222544565050665 |
oct | 3007011652112335 |
9 | 456386071170131 |
10 | 106035472274653 |
11 | 3087143383a599 |
12 | ba86475155391 |
13 | 47221434c4c6c |
14 | 1c28203b271a5 |
15 | c3d35c9c601d |
hex | 60704ea894dd |
106035472274653 has 16 divisors (see below), whose sum is σ = 108169223601600. Its totient is φ = 103906684776960.
The previous prime is 106035472274603. The next prime is 106035472274659. The reversal of 106035472274653 is 356472274530601.
It is a cyclic number.
It is not a de Polignac number, because 106035472274653 - 237 = 105898033321181 is a prime.
It is a super-2 number, since 2×1060354722746532 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106035472274594 and 106035472274603.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106035472274659) 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, 323372458 + ... + 323700196.
It is an arithmetic number, because the mean of its divisors is an integer number (6760576475100).
Almost surely, 2106035472274653 is an apocalyptic number.
It is an amenable number.
106035472274653 is a deficient number, since it is larger than the sum of its proper divisors (2133751326947).
106035472274653 is an equidigital number, since it uses as much as digits as its factorization.
106035472274653 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 335292.
The product of its (nonzero) digits is 25401600, while the sum is 55.
The spelling of 106035472274653 in words is "one hundred six trillion, thirty-five billion, four hundred seventy-two million, two hundred seventy-four thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •