Base | Representation |
---|---|
bin | 110111111000111011… |
… | …1101011001110100111 |
3 | 102110210112121101200012 |
4 | 1233301313223032213 |
5 | 3431301114133111 |
6 | 131045400240435 |
7 | 11446154226443 |
oct | 1576167531647 |
9 | 373715541605 |
10 | 120022021031 |
11 | 469a0335920 |
12 | 1b31717011b |
13 | b419927673 |
14 | 5b48239823 |
15 | 31c6da548b |
hex | 1bf1deb3a7 |
120022021031 has 32 divisors (see below), whose sum is σ = 135196723200. Its totient is φ = 105632916480.
The previous prime is 120022020953. The next prime is 120022021061. The reversal of 120022021031 is 130120220021.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 120022021031 - 218 = 120021758887 is a prime.
It is a super-2 number, since 2×1200220210312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 120022020997 and 120022021015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120022021061) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9181406 + ... + 9194468.
It is an arithmetic number, because the mean of its divisors is an integer number (4224897600).
Almost surely, 2120022021031 is an apocalyptic number.
120022021031 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
120022021031 is a deficient number, since it is larger than the sum of its proper divisors (15174702169).
120022021031 is a wasteful number, since it uses less digits than its factorization.
120022021031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13359.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 120022021031 its reverse (130120220021), we get a palindrome (250142241052).
The spelling of 120022021031 in words is "one hundred twenty billion, twenty-two million, twenty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •