Base | Representation |
---|---|
bin | 110001011010011100… |
… | …1101000010100001101 |
3 | 101010220021121222010101 |
4 | 1202310321220110031 |
5 | 3214310220040300 |
6 | 120425340011101 |
7 | 10444415666440 |
oct | 1426471502415 |
9 | 333807558111 |
10 | 106114221325 |
11 | 41003791082 |
12 | 18695530a91 |
13 | a01145b098 |
14 | 51c90c3657 |
15 | 2b60dd5b6a |
hex | 18b4e6850d |
106114221325 has 24 divisors (see below), whose sum is σ = 150391410048. Its totient is φ = 72758038080.
The previous prime is 106114221319. The next prime is 106114221347. The reversal of 106114221325 is 523122411601.
It is not a de Polignac number, because 106114221325 - 25 = 106114221293 is a prime.
It is a super-2 number, since 2×1061142213252 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 106114221293 and 106114221302.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3606624 + ... + 3635926.
It is an arithmetic number, because the mean of its divisors is an integer number (6266308752).
Almost surely, 2106114221325 is an apocalyptic number.
It is an amenable number.
106114221325 is a deficient number, since it is larger than the sum of its proper divisors (44277188723).
106114221325 is a wasteful number, since it uses less digits than its factorization.
106114221325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50013 (or 50008 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 28.
Adding to 106114221325 its reverse (523122411601), we get a palindrome (629236632926).
The spelling of 106114221325 in words is "one hundred six billion, one hundred fourteen million, two hundred twenty-one thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •