Base | Representation |
---|---|
bin | 1011110111001110110111… |
… | …0010000111110011111101 |
3 | 1201011221120122100002020111 |
4 | 2331303231302013303331 |
5 | 3202201102033100140 |
6 | 43424034503550021 |
7 | 2514235224050266 |
oct | 275635562076375 |
9 | 51157518302214 |
10 | 13043510050045 |
11 | 41797a341a342 |
12 | 1567b0515b311 |
13 | 737cc7cb5867 |
14 | 33144884996d |
15 | 1794593b37ea |
hex | bdcedc87cfd |
13043510050045 has 16 divisors (see below), whose sum is σ = 15747285830400. Its totient is φ = 10371608452800.
The previous prime is 13043510050019. The next prime is 13043510050049. The reversal of 13043510050045 is 54005001534031.
It is not a de Polignac number, because 13043510050045 - 29 = 13043510049533 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13043510049989 and 13043510050016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13043510050049) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10862095 + ... + 12003004.
It is an arithmetic number, because the mean of its divisors is an integer number (984205364400).
Almost surely, 213043510050045 is an apocalyptic number.
It is an amenable number.
13043510050045 is a deficient number, since it is larger than the sum of its proper divisors (2703775780355).
13043510050045 is a wasteful number, since it uses less digits than its factorization.
13043510050045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22865796.
The product of its (nonzero) digits is 18000, while the sum is 31.
Adding to 13043510050045 its reverse (54005001534031), we get a palindrome (67048511584076).
The spelling of 13043510050045 in words is "thirteen trillion, forty-three billion, five hundred ten million, fifty thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •