Base | Representation |
---|---|
bin | 10111001100010110101000… |
… | …01111100110001110010111 |
3 | 20200120202002020200211000222 |
4 | 23212023110033212032113 |
5 | 23141104100121444343 |
6 | 300245555125024555 |
7 | 13512526111413452 |
oct | 1346132417461627 |
9 | 220522066624028 |
10 | 51002002531223 |
11 | 1528391189a367 |
12 | 587864355515b |
13 | 225c611841023 |
14 | c8471d9a8499 |
15 | 5d6a2c0d8a68 |
hex | 2e62d43e6397 |
51002002531223 has 4 divisors (see below), whose sum is σ = 51002245122408. Its totient is φ = 51001759940040.
The previous prime is 51002002531189. The next prime is 51002002531231. The reversal of 51002002531223 is 32213520020015.
It is a happy number.
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 51002002531223 - 212 = 51002002527127 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 51002002531192 and 51002002531201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51002002531273) 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, 120979961 + ... + 121400802.
It is an arithmetic number, because the mean of its divisors is an integer number (12750561280602).
Almost surely, 251002002531223 is an apocalyptic number.
51002002531223 is a deficient number, since it is larger than the sum of its proper divisors (242591185).
51002002531223 is a wasteful number, since it uses less digits than its factorization.
51002002531223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 242591184.
The product of its (nonzero) digits is 3600, while the sum is 26.
Adding to 51002002531223 its reverse (32213520020015), we get a palindrome (83215522551238).
The spelling of 51002002531223 in words is "fifty-one trillion, two billion, two million, five hundred thirty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •