Base | Representation |
---|---|
bin | 1100001100001011101000… |
… | …1001111100000100011001 |
3 | 1202110100120110112100210002 |
4 | 3003002322021330010121 |
5 | 3224100201302143113 |
6 | 44301240251302345 |
7 | 2552236161546353 |
oct | 303027211740431 |
9 | 52410513470702 |
10 | 13403421131033 |
11 | 42a83a489050a |
12 | 160580a74a9b5 |
13 | 762c2500a73b |
14 | 344a2c6d60d3 |
15 | 1839c15adc58 |
hex | c30ba27c119 |
13403421131033 has 64 divisors (see below), whose sum is σ = 14143102848000. Its totient is φ = 12692104151040.
The previous prime is 13403421131027. The next prime is 13403421131041. The reversal of 13403421131033 is 33013112430431.
It is a cyclic number.
It is not a de Polignac number, because 13403421131033 - 210 = 13403421130009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13403421130987 and 13403421131005.
It is not an unprimeable number, because it can be changed into a prime (13403421101033) 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 63 ways as a sum of consecutive naturals, for example, 18641753648 + ... + 18641754366.
It is an arithmetic number, because the mean of its divisors is an integer number (220985982000).
Almost surely, 213403421131033 is an apocalyptic number.
It is an amenable number.
13403421131033 is a deficient number, since it is larger than the sum of its proper divisors (739681716967).
13403421131033 is a wasteful number, since it uses less digits than its factorization.
13403421131033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1362.
The product of its (nonzero) digits is 7776, while the sum is 29.
Adding to 13403421131033 its reverse (33013112430431), we get a palindrome (46416533561464).
The spelling of 13403421131033 in words is "thirteen trillion, four hundred three billion, four hundred twenty-one million, one hundred thirty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •