Base | Representation |
---|---|
bin | 101111001010111110… |
… | …1101101110010011010 |
3 | 100200110210020221022100 |
4 | 1132111331231302122 |
5 | 3124430324400242 |
6 | 114311531304230 |
7 | 10214212521243 |
oct | 1362575556232 |
9 | 320423227270 |
10 | 101300231322 |
11 | 39a63381144 |
12 | 177712ab076 |
13 | 9724cc8aa4 |
14 | 4c8da01cca |
15 | 297d47354c |
hex | 1795f6dc9a |
101300231322 has 24 divisors (see below), whose sum is σ = 219708523476. Its totient is φ = 33732176256.
The previous prime is 101300231297. The next prime is 101300231407. The reversal of 101300231322 is 223132003101.
101300231322 is a `hidden beast` number, since 10 + 1 + 300 + 2 + 31 + 322 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 100261522881 + 1038708441 = 316641^2 + 32229^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 101300231295 and 101300231304.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2862553 + ... + 2897724.
Almost surely, 2101300231322 is an apocalyptic number.
101300231322 is an abundant number, since it is smaller than the sum of its proper divisors (118408292154).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101300231322 is a wasteful number, since it uses less digits than its factorization.
101300231322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5761262 (or 5761259 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 101300231322 its reverse (223132003101), we get a palindrome (324432234423).
The spelling of 101300231322 in words is "one hundred one billion, three hundred million, two hundred thirty-one thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •