Base | Representation |
---|---|
bin | 101111100010011111… |
… | …000110010100111101 |
3 | 11212202101010101200201 |
4 | 233202133012110331 |
5 | 1314014334142303 |
6 | 35241031323501 |
7 | 3454633416253 |
oct | 574237062475 |
9 | 155671111621 |
10 | 51044443453 |
11 | 1a714291963 |
12 | 9a86820591 |
13 | 4a7626b0c3 |
14 | 268332a5d3 |
15 | 14db40481d |
hex | be27c653d |
51044443453 has 4 divisors (see below), whose sum is σ = 51045090300. Its totient is φ = 51043796608.
The previous prime is 51044443451. The next prime is 51044443469. The reversal of 51044443453 is 35434444015.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 35434444015 = 5 ⋅7086888803.
It can be written as a sum of positive squares in 2 ways, for example, as 29481576804 + 21562866649 = 171702^2 + 146843^2 .
It is a cyclic number.
It is not a de Polignac number, because 51044443453 - 21 = 51044443451 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51044443451) 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, 185428 + ... + 369421.
It is an arithmetic number, because the mean of its divisors is an integer number (12761272575).
Almost surely, 251044443453 is an apocalyptic number.
It is an amenable number.
51044443453 is a deficient number, since it is larger than the sum of its proper divisors (646847).
51044443453 is an equidigital number, since it uses as much as digits as its factorization.
51044443453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 646846.
The product of its (nonzero) digits is 230400, while the sum is 37.
Adding to 51044443453 its reverse (35434444015), we get a palindrome (86478887468).
The spelling of 51044443453 in words is "fifty-one billion, forty-four million, four hundred forty-three thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •