Base | Representation |
---|---|
bin | 10111010000011000011110… |
… | …10010101010011010000001 |
3 | 20201001222101122102202111110 |
4 | 23220030033102222122001 |
5 | 23200341101112102001 |
6 | 300433331252033533 |
7 | 13525526403616404 |
oct | 1350141722523201 |
9 | 221058348382443 |
10 | 51140432144001 |
11 | 15327598798322 |
12 | 589b4373028a9 |
13 | 226c6a2c67bc5 |
14 | c8b2d280dd3b |
15 | 5da43000a3d6 |
hex | 2e830f4aa681 |
51140432144001 has 24 divisors (see below), whose sum is σ = 73004547343360. Its totient is φ = 31835451900672.
The previous prime is 51140432143993. The next prime is 51140432144023. The reversal of 51140432144001 is 10044123404115.
It is not a de Polignac number, because 51140432144001 - 23 = 51140432143993 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 51140432144001.
It is not an unprimeable number, because it can be changed into a prime (51140432144101) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 232116286 + ... + 232336503.
Almost surely, 251140432144001 is an apocalyptic number.
51140432144001 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
It is an amenable number.
51140432144001 is a deficient number, since it is larger than the sum of its proper divisors (21864115199359).
51140432144001 is a wasteful number, since it uses less digits than its factorization.
51140432144001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 464452953 (or 464452936 counting only the distinct ones).
The product of its (nonzero) digits is 7680, while the sum is 30.
Adding to 51140432144001 its reverse (10044123404115), we get a palindrome (61184555548116).
The spelling of 51140432144001 in words is "fifty-one trillion, one hundred forty billion, four hundred thirty-two million, one hundred forty-four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •