Base | Representation |
---|---|
bin | 111010111101010010… |
… | …1110000110010100000 |
3 | 110002210201111120121200 |
4 | 1311322211300302200 |
5 | 4033244324133404 |
6 | 134055244121200 |
7 | 12101350540356 |
oct | 1657245606240 |
9 | 402721446550 |
10 | 126610771104 |
11 | 49771530314 |
12 | 20655836200 |
13 | bc2998054c |
14 | 61b13037d6 |
15 | 3460537839 |
hex | 1d7a970ca0 |
126610771104 has 36 divisors (see below), whose sum is σ = 360049381146. Its totient is φ = 42203590272.
The previous prime is 126610771103. The next prime is 126610771109. The reversal of 126610771104 is 401177016621.
126610771104 is a `hidden beast` number, since 1 + 26 + 610 + 7 + 7 + 1 + 10 + 4 = 666.
It can be written as a sum of positive squares in only one way, i.e., 104006250000 + 22604521104 = 322500^2 + 150348^2 .
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (126610771103) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 219810079 + ... + 219810654.
Almost surely, 2126610771104 is an apocalyptic number.
It is an amenable number.
126610771104 is an abundant number, since it is smaller than the sum of its proper divisors (233438610042).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
126610771104 is a wasteful number, since it uses less digits than its factorization.
126610771104 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 439620749 (or 439620738 counting only the distinct ones).
The product of its (nonzero) digits is 14112, while the sum is 36.
Adding to 126610771104 its reverse (401177016621), we get a palindrome (527787787725).
The spelling of 126610771104 in words is "one hundred twenty-six billion, six hundred ten million, seven hundred seventy-one thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •