Base | Representation |
---|---|
bin | 1110111011111100110… |
… | …11011100101111110001 |
3 | 1211001201100011202011120 |
4 | 13131332123130233301 |
5 | 31402034342424243 |
6 | 1031434313332453 |
7 | 52036061000664 |
oct | 7357633345761 |
9 | 1731640152146 |
10 | 513222233073 |
11 | 188724630950 |
12 | 83571107129 |
13 | 3952058c724 |
14 | 1aba92bb6db |
15 | d53b831c83 |
hex | 777e6dcbf1 |
513222233073 has 8 divisors (see below), whose sum is σ = 746505066336. Its totient is φ = 311043777600.
The previous prime is 513222233053. The next prime is 513222233089. The reversal of 513222233073 is 370332222315.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 513222233073 - 224 = 513205455857 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 15552188881 = 513222233073 / (5 + 1 + 3 + 2 + 2 + 2 + 2 + 3 + 3 + 0 + 7 + 3).
It is not an unprimeable number, because it can be changed into a prime (513222233053) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7776094408 + ... + 7776094473.
It is an arithmetic number, because the mean of its divisors is an integer number (93313133292).
Almost surely, 2513222233073 is an apocalyptic number.
It is an amenable number.
513222233073 is a deficient number, since it is larger than the sum of its proper divisors (233282833263).
513222233073 is a wasteful number, since it uses less digits than its factorization.
513222233073 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15552188895.
The product of its (nonzero) digits is 45360, while the sum is 33.
Adding to 513222233073 its reverse (370332222315), we get a palindrome (883554455388).
The spelling of 513222233073 in words is "five hundred thirteen billion, two hundred twenty-two million, two hundred thirty-three thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.146 sec. • engine limits •