Base | Representation |
---|---|
bin | 111010011111001000100001… |
… | …1010001000001010111100001 |
3 | 2111110112011100002220211022102 |
4 | 1310332101003101001113201 |
5 | 1014412241313140003101 |
6 | 5022052043520420145 |
7 | 213234644566611416 |
oct | 16476210321012741 |
9 | 2443464302824272 |
10 | 514452311250401 |
11 | 139a13aaaa584a7 |
12 | 4984837a177655 |
13 | 1910984c7a9874 |
14 | 91078a633810d |
15 | 3e7214292e86b |
hex | 1d3e4434415e1 |
514452311250401 has 8 divisors (see below), whose sum is σ = 522861220976640. Its totient is φ = 506080202005152.
The previous prime is 514452311250337. The next prime is 514452311250433. The reversal of 514452311250401 is 104052113254415.
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 514452311250401 - 26 = 514452311250337 is a prime.
It is a super-2 number, since 2×5144523112504012 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (514452311250461) 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, 9200092061 + ... + 9200147978.
It is an arithmetic number, because the mean of its divisors is an integer number (65357652622080).
Almost surely, 2514452311250401 is an apocalyptic number.
It is an amenable number.
514452311250401 is a deficient number, since it is larger than the sum of its proper divisors (8408909726239).
514452311250401 is a wasteful number, since it uses less digits than its factorization.
514452311250401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18400240495.
The product of its (nonzero) digits is 96000, while the sum is 38.
The spelling of 514452311250401 in words is "five hundred fourteen trillion, four hundred fifty-two billion, three hundred eleven million, two hundred fifty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •