Base | Representation |
---|---|
bin | 11001101000100000… |
… | …10101101101011011 |
3 | 1022112001212201201202 |
4 | 30310100111231123 |
5 | 211140432202342 |
6 | 10153314504415 |
7 | 665011446545 |
oct | 146420255533 |
9 | 38461781652 |
10 | 13761600347 |
11 | 5922079030 |
12 | 280089510b |
13 | 13b40cb5b1 |
14 | 94797a695 |
15 | 558241332 |
hex | 334415b5b |
13761600347 has 32 divisors (see below), whose sum is σ = 15928358400. Its totient is φ = 11773484800.
The previous prime is 13761600337. The next prime is 13761600353. The reversal of 13761600347 is 74300616731.
13761600347 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13761600347 - 226 = 13694491483 is a prime.
It is a super-2 number, since 2×137616003472 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13761600347.
It is not an unprimeable number, because it can be changed into a prime (13761600337) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2012348 + ... + 2019174.
It is an arithmetic number, because the mean of its divisors is an integer number (497761200).
Almost surely, 213761600347 is an apocalyptic number.
13761600347 is a deficient number, since it is larger than the sum of its proper divisors (2166758053).
13761600347 is a wasteful number, since it uses less digits than its factorization.
13761600347 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7027.
The product of its (nonzero) digits is 63504, while the sum is 38.
The spelling of 13761600347 in words is "thirteen billion, seven hundred sixty-one million, six hundred thousand, three hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •