Base | Representation |
---|---|
bin | 1100001110011000111000… |
… | …0001001011000100010111 |
3 | 1202120222102202210210201021 |
4 | 3003212032001023010113 |
5 | 3230210323321410320 |
6 | 44330510400342011 |
7 | 2555050551166546 |
oct | 303461601130427 |
9 | 52528382723637 |
10 | 13441335341335 |
11 | 4312490426910 |
12 | 1611030014907 |
13 | 766687c091c5 |
14 | 3467c7c7615d |
15 | 18498edd8daa |
hex | c398e04b117 |
13441335341335 has 16 divisors (see below), whose sum is σ = 18202686107040. Its totient is φ = 9438429831040.
The previous prime is 13441335341333. The next prime is 13441335341341. The reversal of 13441335341335 is 53314353314431.
It is not a de Polignac number, because 13441335341335 - 21 = 13441335341333 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13441335341291 and 13441335341300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13441335341333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4213583152 + ... + 4213586341.
It is an arithmetic number, because the mean of its divisors is an integer number (1137667881690).
Almost surely, 213441335341335 is an apocalyptic number.
13441335341335 is a deficient number, since it is larger than the sum of its proper divisors (4761350765705).
13441335341335 is a wasteful number, since it uses less digits than its factorization.
13441335341335 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8427169538.
The product of its digits is 1166400, while the sum is 43.
Adding to 13441335341335 its reverse (53314353314431), we get a palindrome (66755688655766).
The spelling of 13441335341335 in words is "thirteen trillion, four hundred forty-one billion, three hundred thirty-five million, three hundred forty-one thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •