Base | Representation |
---|---|
bin | 1011110110101000011101… |
… | …0010100001010110110101 |
3 | 1201010221222011012111100011 |
4 | 2331222013102201112311 |
5 | 3202013443320233240 |
6 | 43415211503420221 |
7 | 2513421600562600 |
oct | 275520722412665 |
9 | 51127864174304 |
10 | 13033200555445 |
11 | 4175392a36474 |
12 | 1565b085b4671 |
13 | 737044154ab5 |
14 | 330b4b561337 |
15 | 17905426d6ea |
hex | bda874a15b5 |
13033200555445 has 24 divisors (see below), whose sum is σ = 18984296398464. Its totient is φ = 8548484335776.
The previous prime is 13033200555437. The next prime is 13033200555517. The reversal of 13033200555445 is 54455500233031.
It is not a de Polignac number, because 13033200555445 - 23 = 13033200555437 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13033200555398 and 13033200555407.
It is a congruent number.
It is an unprimeable number.
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 in 23 ways as a sum of consecutive naturals, for example, 1156445169 + ... + 1156456438.
It is an arithmetic number, because the mean of its divisors is an integer number (791012349936).
Almost surely, 213033200555445 is an apocalyptic number.
It is an amenable number.
13033200555445 is a deficient number, since it is larger than the sum of its proper divisors (5951095843019).
13033200555445 is a wasteful number, since it uses less digits than its factorization.
13033200555445 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2312901649 (or 2312901642 counting only the distinct ones).
The product of its (nonzero) digits is 540000, while the sum is 40.
Adding to 13033200555445 its reverse (54455500233031), we get a palindrome (67488700788476).
The spelling of 13033200555445 in words is "thirteen trillion, thirty-three billion, two hundred million, five hundred fifty-five thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •