Base | Representation |
---|---|
bin | 1011111011111000101010… |
… | …1101000010111001011001 |
3 | 1201110120220221111201000111 |
4 | 2332332022231002321121 |
5 | 3210003312222402213 |
6 | 43524455232404321 |
7 | 2523065243525146 |
oct | 276761255027131 |
9 | 51416827451014 |
10 | 13123452153433 |
11 | 41aa696681886 |
12 | 157b4b56a66a1 |
13 | 7426c8128c0b |
14 | 33526da333cd |
15 | 17b587747a3d |
hex | bef8ab42e59 |
13123452153433 has 16 divisors (see below), whose sum is σ = 13634685369360. Its totient is φ = 12616150579200.
The previous prime is 13123452153403. The next prime is 13123452153437. The reversal of 13123452153433 is 33435125432131.
It can be written as a sum of positive squares in 8 ways, for example, as 329760765504 + 12793691387929 = 574248^2 + 3576827^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13123452153433 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13123452153437) 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, 40802341 + ... + 41122717.
It is an arithmetic number, because the mean of its divisors is an integer number (852167835585).
Almost surely, 213123452153433 is an apocalyptic number.
It is an amenable number.
13123452153433 is a deficient number, since it is larger than the sum of its proper divisors (511233215927).
13123452153433 is a wasteful number, since it uses less digits than its factorization.
13123452153433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 326508.
The product of its digits is 388800, while the sum is 40.
Adding to 13123452153433 its reverse (33435125432131), we get a palindrome (46558577585564).
The spelling of 13123452153433 in words is "thirteen trillion, one hundred twenty-three billion, four hundred fifty-two million, one hundred fifty-three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •