Base | Representation |
---|---|
bin | 1100001100001011100100… |
… | …1101100011100100010011 |
3 | 1202110100112100202011110220 |
4 | 3003002321031203210103 |
5 | 3224100133224131120 |
6 | 44301234524124123 |
7 | 2552235610161600 |
oct | 303027115434423 |
9 | 52410470664426 |
10 | 13403405302035 |
11 | 42a83969599a1 |
12 | 1605805396643 |
13 | 762c21957978 |
14 | 344a2a5756a7 |
15 | 1839beed3b40 |
hex | c30b9363913 |
13403405302035 has 48 divisors (see below), whose sum is σ = 25050259995552. Its totient is φ = 6101846553600.
The previous prime is 13403405302019. The next prime is 13403405302037. The reversal of 13403405302035 is 53020350430431.
It is not a de Polignac number, because 13403405302035 - 24 = 13403405302019 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13403405301987 and 13403405302005.
It is not an unprimeable number, because it can be changed into a prime (13403405302037) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 37656736 + ... + 38011005.
It is an arithmetic number, because the mean of its divisors is an integer number (521880416574).
Almost surely, 213403405302035 is an apocalyptic number.
13403405302035 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
13403405302035 is a deficient number, since it is larger than the sum of its proper divisors (11646854693517).
13403405302035 is a wasteful number, since it uses less digits than its factorization.
13403405302035 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 75668004 (or 75667997 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 33.
Adding to 13403405302035 its reverse (53020350430431), we get a palindrome (66423755732466).
The spelling of 13403405302035 in words is "thirteen trillion, four hundred three billion, four hundred five million, three hundred two thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •