Base | Representation |
---|---|
bin | 101111010100010011… |
… | …0001100010111101001 |
3 | 100201021120110201010212 |
4 | 1132220212030113221 |
5 | 3131100341112413 |
6 | 114402535350505 |
7 | 10225026552203 |
oct | 1365046142751 |
9 | 321246421125 |
10 | 101612832233 |
11 | 3a103881900 |
12 | 17839b22435 |
13 | 97749b9243 |
14 | 4cbd335773 |
15 | 299ab20ca8 |
hex | 17a898c5e9 |
101612832233 has 12 divisors (see below), whose sum is σ = 112439756100. Its totient is φ = 91755317280.
The previous prime is 101612832227. The next prime is 101612832241. The reversal of 101612832233 is 332238216101.
It can be written as a sum of positive squares in 2 ways, for example, as 4520141824 + 97092690409 = 67232^2 + 311597^2 .
It is not a de Polignac number, because 101612832233 - 28 = 101612831977 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 101612832233.
It is not an unprimeable number, because it can be changed into a prime (101612862233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2800010 + ... + 2836067.
It is an arithmetic number, because the mean of its divisors is an integer number (9369979675).
Almost surely, 2101612832233 is an apocalyptic number.
It is an amenable number.
101612832233 is a deficient number, since it is larger than the sum of its proper divisors (10826923867).
101612832233 is a wasteful number, since it uses less digits than its factorization.
101612832233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5636248 (or 5636237 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 32.
The spelling of 101612832233 in words is "one hundred one billion, six hundred twelve million, eight hundred thirty-two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •