Base | Representation |
---|---|
bin | 110001100100111011… |
… | …0010100111111011001 |
3 | 101011210202221210001100 |
4 | 1203021312110333121 |
5 | 3221020203133043 |
6 | 120524252542013 |
7 | 10456214216364 |
oct | 1431166247731 |
9 | 334722853040 |
10 | 106465677273 |
11 | 4117411013a |
12 | 18773181909 |
13 | a069203b97 |
14 | 521da4d0db |
15 | 2b81baacd3 |
hex | 18c9d94fd9 |
106465677273 has 12 divisors (see below), whose sum is σ = 153982710180. Its totient is φ = 70885293216.
The previous prime is 106465677271. The next prime is 106465677277. The reversal of 106465677273 is 372776564601.
It is a happy number.
106465677273 is a `hidden beast` number, since 1 + 0 + 6 + 4 + 6 + 567 + 7 + 2 + 73 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 3098926224 + 103366751049 = 55668^2 + 321507^2 .
It is not a de Polignac number, because 106465677273 - 21 = 106465677271 is a prime.
It is a super-2 number, since 2×1064656772732 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (106465677271) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7644738 + ... + 7658651.
It is an arithmetic number, because the mean of its divisors is an integer number (12831892515).
Almost surely, 2106465677273 is an apocalyptic number.
It is an amenable number.
106465677273 is a deficient number, since it is larger than the sum of its proper divisors (47517032907).
106465677273 is a wasteful number, since it uses less digits than its factorization.
106465677273 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15304168 (or 15304165 counting only the distinct ones).
The product of its (nonzero) digits is 8890560, while the sum is 54.
The spelling of 106465677273 in words is "one hundred six billion, four hundred sixty-five million, six hundred seventy-seven thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •