Base | Representation |
---|---|
bin | 111010011110011001001010… |
… | …1000110100011101110000101 |
3 | 2111110011102211000201012122020 |
4 | 1310330302111012203232011 |
5 | 1014404110014341233013 |
6 | 5021533223403153353 |
7 | 213224414324136333 |
oct | 16474622506435605 |
9 | 2443142730635566 |
10 | 514350605024133 |
11 | 139984959497349 |
12 | 49830714b15859 |
13 | 191000916508a7 |
14 | 91029b8850b53 |
15 | 3e6e68da11623 |
hex | 1d3cc951a3b85 |
514350605024133 has 8 divisors (see below), whose sum is σ = 685840662687168. Its totient is φ = 342880475355264.
The previous prime is 514350605024119. The next prime is 514350605024147. The reversal of 514350605024133 is 331420506053415.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (514350605024119) and next prime (514350605024147).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 514350605024133 - 220 = 514350603975557 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (514350605014133) 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, 4981938316 + ... + 4982041557.
It is an arithmetic number, because the mean of its divisors is an integer number (85730082835896).
Almost surely, 2514350605024133 is an apocalyptic number.
It is an amenable number.
514350605024133 is a deficient number, since it is larger than the sum of its proper divisors (171490057663035).
514350605024133 is a wasteful number, since it uses less digits than its factorization.
514350605024133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9963997083.
The product of its (nonzero) digits is 648000, while the sum is 42.
The spelling of 514350605024133 in words is "five hundred fourteen trillion, three hundred fifty billion, six hundred five million, twenty-four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •