Base | Representation |
---|---|
bin | 10111010010010011101111… |
… | …10100000010101100000001 |
3 | 20201022022012201012001121222 |
4 | 23221021313310002230001 |
5 | 23202432114204442423 |
6 | 300523554134124425 |
7 | 13533361352244545 |
oct | 1351116764025401 |
9 | 221268181161558 |
10 | 51206610234113 |
11 | 15352668583984 |
12 | 58b02261b0715 |
13 | 22759bb6465c9 |
14 | c905ad9cda25 |
15 | 5dc004d233c8 |
hex | 2e9277d02b01 |
51206610234113 has 4 divisors (see below), whose sum is σ = 51703761789888. Its totient is φ = 50709458678340.
The previous prime is 51206610234103. The next prime is 51206610234133. The reversal of 51206610234113 is 31143201660215.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 51206610234113 - 26 = 51206610234049 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (51206610234103) 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, 248575777733 + ... + 248575777938.
It is an arithmetic number, because the mean of its divisors is an integer number (12925940447472).
Almost surely, 251206610234113 is an apocalyptic number.
It is an amenable number.
51206610234113 is a deficient number, since it is larger than the sum of its proper divisors (497151555775).
51206610234113 is a wasteful number, since it uses less digits than its factorization.
51206610234113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 497151555774.
The product of its (nonzero) digits is 25920, while the sum is 35.
Adding to 51206610234113 its reverse (31143201660215), we get a palindrome (82349811894328).
The spelling of 51206610234113 in words is "fifty-one trillion, two hundred six billion, six hundred ten million, two hundred thirty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •