Base | Representation |
---|---|
bin | 1100000011001… |
… | …10000011101010 |
3 | 21001012110111200 |
4 | 12001212003222 |
5 | 201334100242 |
6 | 14010305030 |
7 | 2335114506 |
oct | 601460352 |
9 | 231173450 |
10 | 101081322 |
11 | 5206a991 |
12 | 29a28176 |
13 | 17c31a44 |
14 | d5d3306 |
15 | 8d1a04c |
hex | 60660ea |
101081322 has 12 divisors (see below), whose sum is σ = 219009570. Its totient is φ = 33693768.
The previous prime is 101081317. The next prime is 101081329. The reversal of 101081322 is 223180101.
It can be written as a sum of positive squares in only one way, i.e., 83010321 + 18071001 = 9111^2 + 4251^2 .
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 5615629 = 101081322 / (1 + 0 + 1 + 0 + 8 + 1 + 3 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 101081295 and 101081304.
It is not an unprimeable number, because it can be changed into a prime (101081329) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2807797 + ... + 2807832.
Almost surely, 2101081322 is an apocalyptic number.
101081322 is an abundant number, since it is smaller than the sum of its proper divisors (117928248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101081322 is a wasteful number, since it uses less digits than its factorization.
101081322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5615637 (or 5615634 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
The square root of 101081322 is about 10053.9207277559. The cubic root of 101081322 is about 465.8259064665.
The spelling of 101081322 in words is "one hundred one million, eighty-one thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •