Base | Representation |
---|---|
bin | 110111111100100011… |
… | …0000001100011110111 |
3 | 102111002222200002120011 |
4 | 1233321012001203313 |
5 | 3432023131114111 |
6 | 131105410121051 |
7 | 11452155355156 |
oct | 1577106014367 |
9 | 374088602504 |
10 | 120143223031 |
11 | 46a52798767 |
12 | 1b34b880187 |
13 | b438a82720 |
14 | 5b5a38959d |
15 | 31d2847021 |
hex | 1bf91818f7 |
120143223031 has 8 divisors (see below), whose sum is σ = 129842204240. Its totient is φ = 110509555392.
The previous prime is 120143223029. The next prime is 120143223043. The reversal of 120143223031 is 130322341021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 120143223031 - 21 = 120143223029 is a prime.
It is a super-2 number, since 2×1201432230312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120143222993 and 120143223011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120143223061) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16324566 + ... + 16331923.
It is an arithmetic number, because the mean of its divisors is an integer number (16230275530).
Almost surely, 2120143223031 is an apocalyptic number.
120143223031 is a deficient number, since it is larger than the sum of its proper divisors (9698981209).
120143223031 is a wasteful number, since it uses less digits than its factorization.
120143223031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32656785.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 120143223031 its reverse (130322341021), we get a palindrome (250465564052).
The spelling of 120143223031 in words is "one hundred twenty billion, one hundred forty-three million, two hundred twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •