Base | Representation |
---|---|
bin | 100001001011011110001… |
… | …0110001011010111110101 |
3 | 121010221110121201121102012 |
4 | 1002112330112023113311 |
5 | 1044203111234401123 |
6 | 13410520150254005 |
7 | 650313013264205 |
oct | 102267426132765 |
9 | 17127417647365 |
10 | 4560120231413 |
11 | 14a8a32a9682a |
12 | 617947057305 |
13 | 27102c57ba26 |
14 | 11a9d4d92405 |
15 | 7d944b90378 |
hex | 425bc58b5f5 |
4560120231413 has 2 divisors, whose sum is σ = 4560120231414. Its totient is φ = 4560120231412.
The previous prime is 4560120231377. The next prime is 4560120231421. The reversal of 4560120231413 is 3141320210654.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3701860656484 + 858259574929 = 1924022^2 + 926423^2 .
It is a cyclic number.
It is not a de Polignac number, because 4560120231413 - 26 = 4560120231349 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 4560120231413.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4560120231613) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2280060115706 + 2280060115707.
It is an arithmetic number, because the mean of its divisors is an integer number (2280060115707).
Almost surely, 24560120231413 is an apocalyptic number.
It is an amenable number.
4560120231413 is a deficient number, since it is larger than the sum of its proper divisors (1).
4560120231413 is an equidigital number, since it uses as much as digits as its factorization.
4560120231413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17280, while the sum is 32.
The spelling of 4560120231413 in words is "four trillion, five hundred sixty billion, one hundred twenty million, two hundred thirty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •