Base | Representation |
---|---|
bin | 100000011010000111001… |
… | …1110110110001010001011 |
3 | 120202210212120012211220101 |
4 | 1000310032132312022023 |
5 | 1040434021224200011 |
6 | 13250110224310231 |
7 | 636541226525314 |
oct | 100641636661213 |
9 | 16683776184811 |
10 | 4454124053131 |
11 | 1467a8aa00195 |
12 | 5bb2a5172377 |
13 | 264039710bcc |
14 | 11581b83960b |
15 | 7acde3252c1 |
hex | 40d0e7b628b |
4454124053131 has 4 divisors (see below), whose sum is σ = 4716131350392. Its totient is φ = 4192116755872.
The previous prime is 4454124053083. The next prime is 4454124053209. The reversal of 4454124053131 is 1313504214544.
It is a happy number.
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 4454124053131 - 219 = 4454123528843 is a prime.
It is a super-2 number, since 2×44541240531312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4454124051131) 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, 131003648605 + ... + 131003648638.
It is an arithmetic number, because the mean of its divisors is an integer number (1179032837598).
Almost surely, 24454124053131 is an apocalyptic number.
4454124053131 is a deficient number, since it is larger than the sum of its proper divisors (262007297261).
4454124053131 is a wasteful number, since it uses less digits than its factorization.
4454124053131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 262007297260.
The product of its (nonzero) digits is 115200, while the sum is 37.
Adding to 4454124053131 its reverse (1313504214544), we get a palindrome (5767628267675).
The spelling of 4454124053131 in words is "four trillion, four hundred fifty-four billion, one hundred twenty-four million, fifty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •