Base | Representation |
---|---|
bin | 111010011110111011000100… |
… | …1111100100110111000110000 |
3 | 2111110102101210111002200001001 |
4 | 1310331312021330212320300 |
5 | 1014411303142132412240 |
6 | 5022030510132451344 |
7 | 213232603131641011 |
oct | 16475661174467060 |
9 | 2443371714080031 |
10 | 514423432310320 |
11 | 139a02830603375 |
12 | 4984285a779b54 |
13 | 19106bc975a140 |
14 | 9106326b51008 |
15 | 3e7150244b89a |
hex | 1d3dd89f26e30 |
514423432310320 has 80 divisors (see below), whose sum is σ = 1300542347587392. Its totient is φ = 188096872596480.
The previous prime is 514423432310317. The next prime is 514423432310321. The reversal of 514423432310320 is 23013234324415.
It is a tau number, because it is divible by the number of its divisors (80).
It is a self number, because there is not a number n which added to its sum of digits gives 514423432310320.
It is not an unprimeable number, because it can be changed into a prime (514423432310321) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2401047811 + ... + 2401262050.
Almost surely, 2514423432310320 is an apocalyptic number.
It is an amenable number.
514423432310320 is an abundant number, since it is smaller than the sum of its proper divisors (786118915277072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
514423432310320 is a wasteful number, since it uses less digits than its factorization.
514423432310320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4802309990 (or 4802309984 counting only the distinct ones).
The product of its (nonzero) digits is 207360, while the sum is 37.
Adding to 514423432310320 its reverse (23013234324415), we get a palindrome (537436666634735).
The spelling of 514423432310320 in words is "five hundred fourteen trillion, four hundred twenty-three billion, four hundred thirty-two million, three hundred ten thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •