Base | Representation |
---|---|
bin | 1011110111010110011101… |
… | …1001100011111111001101 |
3 | 1201012010211211200020101010 |
4 | 2331311213121203333031 |
5 | 3202214241402312310 |
6 | 43425013152235433 |
7 | 2514336621031314 |
oct | 275654731437715 |
9 | 51163754606333 |
10 | 13045550432205 |
11 | 417a650138695 |
12 | 156839453bb79 |
13 | 73826192b695 |
14 | 33159d81727b |
15 | 1795285a1320 |
hex | bdd67663fcd |
13045550432205 has 32 divisors (see below), whose sum is σ = 21272857787520. Its totient is φ = 6824377114880.
The previous prime is 13045550432143. The next prime is 13045550432209. The reversal of 13045550432205 is 50223405554031.
It is not a de Polignac number, because 13045550432205 - 210 = 13045550431181 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13045550432209) 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 31 ways as a sum of consecutive naturals, for example, 380866 + ... + 5122124.
It is an arithmetic number, because the mean of its divisors is an integer number (664776805860).
Almost surely, 213045550432205 is an apocalyptic number.
13045550432205 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
13045550432205 is a deficient number, since it is larger than the sum of its proper divisors (8227307355315).
13045550432205 is a wasteful number, since it uses less digits than its factorization.
13045550432205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4744781.
The product of its (nonzero) digits is 360000, while the sum is 39.
Adding to 13045550432205 its reverse (50223405554031), we get a palindrome (63268955986236).
The spelling of 13045550432205 in words is "thirteen trillion, forty-five billion, five hundred fifty million, four hundred thirty-two thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •