Base | Representation |
---|---|
bin | 101111000110000000… |
… | …1011110000101110100 |
3 | 100200001011102020100112 |
4 | 1132030001132011310 |
5 | 3124110130142234 |
6 | 114243212402152 |
7 | 10210116041225 |
oct | 1361401360564 |
9 | 320034366315 |
10 | 101133443444 |
11 | 39988212a20 |
12 | 17725476358 |
13 | 96c959c837 |
14 | 4c757c724c |
15 | 296d9c9ace |
hex | 178c05e174 |
101133443444 has 24 divisors (see below), whose sum is σ = 193183981536. Its totient is φ = 45943308000.
The previous prime is 101133443441. The next prime is 101133443461. The reversal of 101133443444 is 444344331101.
It is a super-2 number, since 2×1011334434442 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 101133443444.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101133443441) 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 7 ways as a sum of consecutive naturals, for example, 583502 + ... + 736709.
It is an arithmetic number, because the mean of its divisors is an integer number (8049332564).
Almost surely, 2101133443444 is an apocalyptic number.
It is an amenable number.
101133443444 is a deficient number, since it is larger than the sum of its proper divisors (92050538092).
101133443444 is a wasteful number, since it uses less digits than its factorization.
101133443444 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1321967 (or 1321965 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 32.
Adding to 101133443444 its reverse (444344331101), we get a palindrome (545477774545).
The spelling of 101133443444 in words is "one hundred one billion, one hundred thirty-three million, four hundred forty-three thousand, four hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •