Base | Representation |
---|---|
bin | 11000001110001110011001… |
… | …111011001001000011001111 |
3 | 111222012020020121020011200201 |
4 | 120032032121323021003033 |
5 | 102430344241000312203 |
6 | 1014323301411034331 |
7 | 31303404654351232 |
oct | 3016163173110317 |
9 | 458166217204621 |
10 | 106530656260303 |
11 | 30a42441235140 |
12 | bb4643129b9a7 |
13 | 4759a4a9521b2 |
14 | 1c4417b49d419 |
15 | c4b1908e6e1d |
hex | 60e399ec90cf |
106530656260303 has 8 divisors (see below), whose sum is σ = 116215337552256. Its totient is φ = 96845987664600.
The previous prime is 106530656260297. The next prime is 106530656260331. The reversal of 106530656260303 is 303062656035601.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 106530656260303 - 25 = 106530656260271 is a prime.
It is a super-2 number, since 2×1065306562603032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106530656260373) 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, 26145550 + ... + 29944132.
It is an arithmetic number, because the mean of its divisors is an integer number (14526917194032).
Almost surely, 2106530656260303 is an apocalyptic number.
106530656260303 is a deficient number, since it is larger than the sum of its proper divisors (9684681291953).
106530656260303 is a wasteful number, since it uses less digits than its factorization.
106530656260303 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6348125.
The product of its (nonzero) digits is 1749600, while the sum is 46.
The spelling of 106530656260303 in words is "one hundred six trillion, five hundred thirty billion, six hundred fifty-six million, two hundred sixty thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •