Base | Representation |
---|---|
bin | 10100101011100001011… |
… | …000101011101100110011 |
3 | 12000212011100000222201120 |
4 | 110223201120223230303 |
5 | 141240423330123411 |
6 | 3004504225233323 |
7 | 204446456244426 |
oct | 24534130535463 |
9 | 5025140028646 |
10 | 1421120551731 |
11 | 4a876a559421 |
12 | 1ab50a492843 |
13 | a401b4a9a6a |
14 | 4cad565d9bd |
15 | 26e77471106 |
hex | 14ae162bb33 |
1421120551731 has 4 divisors (see below), whose sum is σ = 1894827402312. Its totient is φ = 947413701152.
The previous prime is 1421120551723. The next prime is 1421120551777. The reversal of 1421120551731 is 1371550211241.
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 1421120551731 - 23 = 1421120551723 is a prime.
It is a super-2 number, since 2×14211205517312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1421120551692 and 1421120551701.
It is not an unprimeable number, because it can be changed into a prime (1421120551931) 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, 236853425286 + ... + 236853425291.
It is an arithmetic number, because the mean of its divisors is an integer number (473706850578).
Almost surely, 21421120551731 is an apocalyptic number.
1421120551731 is a deficient number, since it is larger than the sum of its proper divisors (473706850581).
1421120551731 is an equidigital number, since it uses as much as digits as its factorization.
1421120551731 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 473706850580.
The product of its (nonzero) digits is 8400, while the sum is 33.
Adding to 1421120551731 its reverse (1371550211241), we get a palindrome (2792670762972).
The spelling of 1421120551731 in words is "one trillion, four hundred twenty-one billion, one hundred twenty million, five hundred fifty-one thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •