Base | Representation |
---|---|
bin | 110001101001101011… |
… | …0111110101010011010 |
3 | 101012012220011222022200 |
4 | 1203103112332222122 |
5 | 3221332024402024 |
6 | 120552152431030 |
7 | 10463162341164 |
oct | 1432326765232 |
9 | 335186158280 |
10 | 106625231514 |
11 | 4124618864a |
12 | 187b86a8476 |
13 | a093299789 |
14 | 5236d03934 |
15 | 2b90bc62c9 |
hex | 18d35bea9a |
106625231514 has 96 divisors (see below), whose sum is σ = 247611096720. Its totient is φ = 33043286016.
The previous prime is 106625231483. The next prime is 106625231539. The reversal of 106625231514 is 415132526601.
106625231514 is a `hidden beast` number, since 1 + 0 + 6 + 62 + 52 + 31 + 514 = 666.
It can be written as a sum of positive squares in 8 ways, for example, as 93931829289 + 12693402225 = 306483^2 + 112665^2 .
It is a super-2 number, since 2×1066252315142 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 8304852 + ... + 8317680.
Almost surely, 2106625231514 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 106625231514, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (123805548360).
106625231514 is an abundant number, since it is smaller than the sum of its proper divisors (140985865206).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106625231514 is a wasteful number, since it uses less digits than its factorization.
106625231514 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13184 (or 13181 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 36.
The spelling of 106625231514 in words is "one hundred six billion, six hundred twenty-five million, two hundred thirty-one thousand, five hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •