Base | Representation |
---|---|
bin | 111000010110110010… |
… | …0101010110101001111 |
3 | 102120101100101111222120 |
4 | 1300231210222311033 |
5 | 3440324024443011 |
6 | 131333021144023 |
7 | 11513036143542 |
oct | 1605544526517 |
9 | 376340344876 |
10 | 121023671631 |
11 | 47364786835 |
12 | 1b5566bb013 |
13 | b5492c1c25 |
14 | 5c01296859 |
15 | 3234cb0a06 |
hex | 1c2d92ad4f |
121023671631 has 4 divisors (see below), whose sum is σ = 161364895512. Its totient is φ = 80682447752.
The previous prime is 121023671623. The next prime is 121023671731. The reversal of 121023671631 is 136176320121.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 121023671631 - 23 = 121023671623 is a prime.
It is a super-2 number, since 2×1210236716312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 121023671592 and 121023671601.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121023671611) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20170611936 + ... + 20170611941.
It is an arithmetic number, because the mean of its divisors is an integer number (40341223878).
Almost surely, 2121023671631 is an apocalyptic number.
121023671631 is a deficient number, since it is larger than the sum of its proper divisors (40341223881).
121023671631 is an equidigital number, since it uses as much as digits as its factorization.
121023671631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40341223880.
The product of its (nonzero) digits is 9072, while the sum is 33.
Adding to 121023671631 its reverse (136176320121), we get a palindrome (257199991752).
The spelling of 121023671631 in words is "one hundred twenty-one billion, twenty-three million, six hundred seventy-one thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •