Base | Representation |
---|---|
bin | 110001011010111001… |
… | …1010101111111100001 |
3 | 101010221100002121121211 |
4 | 1202311303111333201 |
5 | 3214323103210000 |
6 | 120431040150121 |
7 | 10444661411254 |
oct | 1426563257741 |
9 | 333840077554 |
10 | 106129350625 |
11 | 41011284a31 |
12 | 1869a608341 |
13 | a01462752c |
14 | 51cb10109b |
15 | 2b623c37ba |
hex | 18b5cd5fe1 |
106129350625 has 45 divisors (see below), whose sum is σ = 135096763791. Its totient is φ = 83346276000.
The previous prime is 106129350623. The next prime is 106129350631. The reversal of 106129350625 is 526053921601.
The square root of 106129350625 is 325775.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 7 ways, for example, as 97549404241 + 8579946384 = 312329^2 + 92628^2 .
It is not a de Polignac number, because 106129350625 - 21 = 106129350623 is a prime.
It is a super-2 number, since 2×1061293506252 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106129350623) by changing a digit.
It is a polite number, since it can be written in 44 ways as a sum of consecutive naturals, for example, 675983047 + ... + 675983203.
Almost surely, 2106129350625 is an apocalyptic number.
106129350625 is the 325775-th square number.
106129350625 is the 162888-th centered octagonal number.
It is an amenable number.
106129350625 is a deficient number, since it is larger than the sum of its proper divisors (28967413166).
106129350625 is an frugal number, since it uses more digits than its factorization.
106129350625 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 500 (or 245 counting only the distinct ones).
The product of its (nonzero) digits is 97200, while the sum is 40.
The spelling of 106129350625 in words is "one hundred six billion, one hundred twenty-nine million, three hundred fifty thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •