Base | Representation |
---|---|
bin | 10111011000011000101001… |
… | …11110011001100101010011 |
3 | 20202001021011000010120220212 |
4 | 23230030110332121211103 |
5 | 23214342222240334301 |
6 | 301203524451154335 |
7 | 13554432451013006 |
oct | 1354142476314523 |
9 | 222037130116825 |
10 | 51415405402451 |
11 | 15423172a53242 |
12 | 59247972a59ab |
13 | 228c5b4b594ac |
14 | c9a739c0753d |
15 | 5e26754b34bb |
hex | 2ec314f99953 |
51415405402451 has 4 divisors (see below), whose sum is σ = 51415728476112. Its totient is φ = 51415082328792.
The previous prime is 51415405402447. The next prime is 51415405402457. The reversal of 51415405402451 is 15420450451415.
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 51415405402451 - 22 = 51415405402447 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 51415405402399 and 51415405402408.
It is not an unprimeable number, because it can be changed into a prime (51415405402457) 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, 161297996 + ... + 161616441.
It is an arithmetic number, because the mean of its divisors is an integer number (12853932119028).
Almost surely, 251415405402451 is an apocalyptic number.
51415405402451 is a deficient number, since it is larger than the sum of its proper divisors (323073661).
51415405402451 is a wasteful number, since it uses less digits than its factorization.
51415405402451 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 323073660.
The product of its (nonzero) digits is 320000, while the sum is 41.
Adding to 51415405402451 its reverse (15420450451415), we get a palindrome (66835855853866).
The spelling of 51415405402451 in words is "fifty-one trillion, four hundred fifteen billion, four hundred five million, four hundred two thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •