Base | Representation |
---|---|
bin | 101111000110001111… |
… | …1100110100001110010 |
3 | 100200001201021112120120 |
4 | 1132030133212201302 |
5 | 3124114140423242 |
6 | 114244053551110 |
7 | 10210243140066 |
oct | 1361437464162 |
9 | 320051245516 |
10 | 101141342322 |
11 | 39991718519 |
12 | 17728045496 |
13 | 96cb106c27 |
14 | 4c76881aa6 |
15 | 296e53a1ec |
hex | 178c7e6872 |
101141342322 has 8 divisors (see below), whose sum is σ = 202282684656. Its totient is φ = 33713780772.
The previous prime is 101141342321. The next prime is 101141342333. The reversal of 101141342322 is 223243141101.
It is a sphenic number, since it is the product of 3 distinct primes.
101141342322 is an admirable number.
It is a super-2 number, since 2×1011413423222 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101141342292 and 101141342301.
It is not an unprimeable number, because it can be changed into a prime (101141342321) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8428445188 + ... + 8428445199.
It is an arithmetic number, because the mean of its divisors is an integer number (25285335582).
Almost surely, 2101141342322 is an apocalyptic number.
101141342322 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101141342322 is a wasteful number, since it uses less digits than its factorization.
101141342322 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16856890392.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 101141342322 its reverse (223243141101), we get a palindrome (324384483423).
The spelling of 101141342322 in words is "one hundred one billion, one hundred forty-one million, three hundred forty-two thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •