Base | Representation |
---|---|
bin | 1100000000100010100111… |
… | …1111111101110100100011 |
3 | 1201202020101000122200011202 |
4 | 3000020221333331310203 |
5 | 3212311113112231201 |
6 | 44025323543231415 |
7 | 2531626256054624 |
oct | 300105177756443 |
9 | 51666330580152 |
10 | 13203434102051 |
11 | 42305aa379666 |
12 | 1592ab744856b |
13 | 74a1035b052b |
14 | 33909a22da4b |
15 | 17d6b934cc6b |
hex | c0229ffdd23 |
13203434102051 has 8 divisors (see below), whose sum is σ = 13406632081920. Its totient is φ = 13001713926088.
The previous prime is 13203434102041. The next prime is 13203434102087. The reversal of 13203434102051 is 15020143430231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13203434102051 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13203434102011) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 369432971 + ... + 369468708.
It is an arithmetic number, because the mean of its divisors is an integer number (1675829010240).
Almost surely, 213203434102051 is an apocalyptic number.
13203434102051 is a deficient number, since it is larger than the sum of its proper divisors (203197979869).
13203434102051 is a wasteful number, since it uses less digits than its factorization.
13203434102051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 738901953.
The product of its (nonzero) digits is 8640, while the sum is 29.
Adding to 13203434102051 its reverse (15020143430231), we get a palindrome (28223577532282).
The spelling of 13203434102051 in words is "thirteen trillion, two hundred three billion, four hundred thirty-four million, one hundred two thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •