Base | Representation |
---|---|
bin | 1110111110100100110… |
… | …10101101000101000101 |
3 | 1211012100112121222111102 |
4 | 13133102122231011011 |
5 | 31412431104331343 |
6 | 1032230211145445 |
7 | 52116021035504 |
oct | 7372232550505 |
9 | 1735315558442 |
10 | 514631323973 |
11 | 189287a69788 |
12 | 838a4ba5285 |
13 | 396b64a2020 |
14 | 1aca04b883b |
15 | d5c03c03b8 |
hex | 77d26ad145 |
514631323973 has 8 divisors (see below), whose sum is σ = 554645674968. Its totient is φ = 474678019584.
The previous prime is 514631323903. The next prime is 514631324023. The reversal of 514631323973 is 379323136415.
It can be written as a sum of positive squares in 4 ways, for example, as 28519778884 + 486111545089 = 168878^2 + 697217^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 514631323973 - 216 = 514631258437 is a prime.
It is a super-2 number, since 2×5146313239732 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (514631323903) 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, 15244136 + ... + 15277857.
It is an arithmetic number, because the mean of its divisors is an integer number (69330709371).
Almost surely, 2514631323973 is an apocalyptic number.
It is an amenable number.
514631323973 is a deficient number, since it is larger than the sum of its proper divisors (40014350995).
514631323973 is a wasteful number, since it uses less digits than its factorization.
514631323973 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30523303.
The product of its digits is 1224720, while the sum is 47.
The spelling of 514631323973 in words is "five hundred fourteen billion, six hundred thirty-one million, three hundred twenty-three thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •