Base | Representation |
---|---|
bin | 1100011101111110011011… |
… | …1001100111100110101010 |
3 | 1210112120121202112210020110 |
4 | 3013133212321213212222 |
5 | 3244102231303140032 |
6 | 45053514045235150 |
7 | 2613310431424563 |
oct | 307374671474652 |
9 | 53476552483213 |
10 | 13709114505642 |
11 | 4406003819386 |
12 | 1654b02862ab6 |
13 | 7859c152775a |
14 | 35574ba2b16a |
15 | 18b9139d87cc |
hex | c77e6e679aa |
13709114505642 has 16 divisors (see below), whose sum is σ = 28302688012032. Its totient is φ = 4422295001760.
The previous prime is 13709114505607. The next prime is 13709114505649. The reversal of 13709114505642 is 24650541190731.
It is a junction number, because it is equal to n+sod(n) for n = 13709114505591 and 13709114505600.
It is not an unprimeable number, because it can be changed into a prime (13709114505649) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36852458163 + ... + 36852458534.
It is an arithmetic number, because the mean of its divisors is an integer number (1768918000752).
Almost surely, 213709114505642 is an apocalyptic number.
13709114505642 is an abundant number, since it is smaller than the sum of its proper divisors (14593573506390).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13709114505642 is a wasteful number, since it uses less digits than its factorization.
13709114505642 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73704916733.
The product of its (nonzero) digits is 907200, while the sum is 48.
The spelling of 13709114505642 in words is "thirteen trillion, seven hundred nine billion, one hundred fourteen million, five hundred five thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •