Base | Representation |
---|---|
bin | 10111011000111011101101… |
… | …00011101101101101000011 |
3 | 20202010001201101201022022212 |
4 | 23230131312203231231003 |
5 | 23220144241421141311 |
6 | 301220320001452335 |
7 | 13555666660144340 |
oct | 1354356643555503 |
9 | 222101641638285 |
10 | 51434222443331 |
11 | 154301497555a2 |
12 | 59283690410ab |
13 | 22912c3428200 |
14 | c9b602d577c7 |
15 | 5e2dc745cc8b |
hex | 2ec7768edb43 |
51434222443331 has 12 divisors (see below), whose sum is σ = 63651480692112. Its totient is φ = 40695208965216.
The previous prime is 51434222443297. The next prime is 51434222443333. The reversal of 51434222443331 is 13334422243415.
It is a happy number.
It is not a de Polignac number, because 51434222443331 - 230 = 51433148701507 is a prime.
It is a super-2 number, since 2×514342224433312 (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 (51434222443333) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 21738892496 + ... + 21738894861.
It is an arithmetic number, because the mean of its divisors is an integer number (5304290057676).
Almost surely, 251434222443331 is an apocalyptic number.
51434222443331 is a deficient number, since it is larger than the sum of its proper divisors (12217258248781).
51434222443331 is a wasteful number, since it uses less digits than its factorization.
51434222443331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43477787390 (or 43477787377 counting only the distinct ones).
The product of its digits is 829440, while the sum is 41.
Adding to 51434222443331 its reverse (13334422243415), we get a palindrome (64768644686746).
The spelling of 51434222443331 in words is "fifty-one trillion, four hundred thirty-four billion, two hundred twenty-two million, four hundred forty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •