Base | Representation |
---|---|
bin | 1011011010111011… |
… | …00000111111000011 |
3 | 120211022100110120020 |
4 | 11231131200333003 |
5 | 100024120433443 |
6 | 2452225344523 |
7 | 304641135222 |
oct | 55535407703 |
9 | 16738313506 |
10 | 6131421123 |
11 | 2667033493 |
12 | 1231498143 |
13 | 769391349 |
14 | 42245ccb9 |
15 | 25d447583 |
hex | 16d760fc3 |
6131421123 has 16 divisors (see below), whose sum is σ = 8340999840. Its totient is φ = 4004941824.
The previous prime is 6131421113. The next prime is 6131421169. The reversal of 6131421123 is 3211241316.
It is a happy number.
It is not a de Polignac number, because 6131421123 - 217 = 6131290051 is a prime.
It is a super-2 number, since 2×61314211232 = 75188649975141162258, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 6131421093 and 6131421102.
It is not an unprimeable number, because it can be changed into a prime (6131421113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 90243 + ... + 142851.
It is an arithmetic number, because the mean of its divisors is an integer number (521312490).
Almost surely, 26131421123 is an apocalyptic number.
6131421123 is a deficient number, since it is larger than the sum of its proper divisors (2209578717).
6131421123 is a wasteful number, since it uses less digits than its factorization.
6131421123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53398.
The product of its digits is 864, while the sum is 24.
The square root of 6131421123 is about 78303.3915165876. The cubic root of 6131421123 is about 1830.2920018384.
Adding to 6131421123 its reverse (3211241316), we get a palindrome (9342662439).
The spelling of 6131421123 in words is "six billion, one hundred thirty-one million, four hundred twenty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •