Base | Representation |
---|---|
bin | 10111010000001111001101… |
… | …00101000101110000001011 |
3 | 20201001111112201110000202122 |
4 | 23220013212211011300023 |
5 | 23200300402230011301 |
6 | 300431145304121455 |
7 | 13525262136400421 |
oct | 1350074645056013 |
9 | 221044481400678 |
10 | 51135454141451 |
11 | 15325473845329 |
12 | 589a48816628b |
13 | 226c08b83b974 |
14 | c8ad7d637111 |
15 | 5da23ce9b81b |
hex | 2e81e6945c0b |
51135454141451 has 8 divisors (see below), whose sum is σ = 52899223821600. Its totient is φ = 49371716338560.
The previous prime is 51135454141427. The next prime is 51135454141469. The reversal of 51135454141451 is 15414145453115.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 51135454141451 - 222 = 51135449947147 is a prime.
It is a super-2 number, since 2×511354541414512 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (59135454141451) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4682735 + ... + 11144456.
It is an arithmetic number, because the mean of its divisors is an integer number (6612402977700).
Almost surely, 251135454141451 is an apocalyptic number.
51135454141451 is a deficient number, since it is larger than the sum of its proper divisors (1763769680149).
51135454141451 is a wasteful number, since it uses less digits than its factorization.
51135454141451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15938629.
The product of its digits is 480000, while the sum is 44.
Adding to 51135454141451 its reverse (15414145453115), we get a palindrome (66549599594566).
The spelling of 51135454141451 in words is "fifty-one trillion, one hundred thirty-five billion, four hundred fifty-four million, one hundred forty-one thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •