Base | Representation |
---|---|
bin | 100110001101011000101… |
… | …1000110111011000001111 |
3 | 200121000211220201110002022 |
4 | 1030122301120313120033 |
5 | 1142014410041334411 |
6 | 15100245530520355 |
7 | 1051255143346553 |
oct | 114326130673017 |
9 | 20530756643068 |
10 | 5251426121231 |
11 | 17451321607a4 |
12 | 709917b960bb |
13 | 2c1290749274 |
14 | 142255749863 |
15 | 9190583eedb |
hex | 4c6b163760f |
5251426121231 has 4 divisors (see below), whose sum is σ = 5310430909200. Its totient is φ = 5192421333264.
The previous prime is 5251426121203. The next prime is 5251426121261. The reversal of 5251426121231 is 1321216241525.
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 5251426121231 - 26 = 5251426121167 is a prime.
It is a super-2 number, since 2×52514261212312 (a number of 26 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 = 5251426121191 and 5251426121200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5251426121261) 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, 29502393851 + ... + 29502394028.
It is an arithmetic number, because the mean of its divisors is an integer number (1327607727300).
Almost surely, 25251426121231 is an apocalyptic number.
5251426121231 is a deficient number, since it is larger than the sum of its proper divisors (59004787969).
5251426121231 is an equidigital number, since it uses as much as digits as its factorization.
5251426121231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 59004787968.
The product of its digits is 28800, while the sum is 35.
The spelling of 5251426121231 in words is "five trillion, two hundred fifty-one billion, four hundred twenty-six million, one hundred twenty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •