Base | Representation |
---|---|
bin | 110001101001010010… |
… | …0110001111110000010 |
3 | 101012011222102102022012 |
4 | 1203102210301332002 |
5 | 3221320142303242 |
6 | 120551002412522 |
7 | 10462642443200 |
oct | 1432244617602 |
9 | 335158372265 |
10 | 106612072322 |
11 | 4123980a988 |
12 | 187b4201142 |
13 | a09063cc82 |
14 | 523527a070 |
15 | 2b8e977282 |
hex | 18d2931f82 |
106612072322 has 18 divisors (see below), whose sum is σ = 186032827683. Its totient is φ = 45689502852.
The previous prime is 106612072321. The next prime is 106612072397. The reversal of 106612072322 is 223270216601.
It can be written as a sum of positive squares in only one way, i.e., 53306036161 + 53306036161 = 230881^2 + 230881^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=230881.
It is a super-2 number, since 2×1066120723222 (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 (106612072321) by changing a digit.
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 8 ways as a sum of consecutive naturals, for example, 3215843 + ... + 3248825.
Almost surely, 2106612072322 is an apocalyptic number.
106612072322 is a deficient number, since it is larger than the sum of its proper divisors (79420755361).
106612072322 is an frugal number, since it uses more digits than its factorization.
106612072322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65982 (or 32992 counting only the distinct ones).
The product of its (nonzero) digits is 12096, while the sum is 32.
Multiplying 106612072322 by its sum of digits (32), we get a square (3411586314304 = 18470482).
Adding to 106612072322 its reverse (223270216601), we get a palindrome (329882288923).
The spelling of 106612072322 in words is "one hundred six billion, six hundred twelve million, seventy-two thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •