Base | Representation |
---|---|
bin | 101111001011000010… |
… | …0111010111111100110 |
3 | 100200110220210220200000 |
4 | 1132112010322333212 |
5 | 3124431320323142 |
6 | 114312040002130 |
7 | 10214234546646 |
oct | 1362604727746 |
9 | 320426726600 |
10 | 101302120422 |
11 | 39a64451488 |
12 | 17771a60346 |
13 | 972550a8b9 |
14 | 4c8dd74526 |
15 | 297d6e814c |
hex | 179613afe6 |
101302120422 has 24 divisors (see below), whose sum is σ = 227617111176. Its totient is φ = 33767373312.
The previous prime is 101302120421. The next prime is 101302120427. The reversal of 101302120422 is 224021203101.
It is a happy number.
101302120422 is a `hidden beast` number, since 1 + 0 + 1 + 30 + 212 + 0 + 422 = 666.
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 = 101302120395 and 101302120404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101302120421) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 104219803 + ... + 104220774.
It is an arithmetic number, because the mean of its divisors is an integer number (9484046299).
Almost surely, 2101302120422 is an apocalyptic number.
101302120422 is an abundant number, since it is smaller than the sum of its proper divisors (126314990754).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101302120422 is an equidigital number, since it uses as much as digits as its factorization.
101302120422 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 208440594 (or 208440582 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 101302120422 its reverse (224021203101), we get a palindrome (325323323523).
The spelling of 101302120422 in words is "one hundred one billion, three hundred two million, one hundred twenty thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •