Base | Representation |
---|---|
bin | 1100011110010100011001… |
… | …1111100110100100011100 |
3 | 1210120010211212002211210220 |
4 | 3013211012133212210130 |
5 | 3244201321344000232 |
6 | 45100331244201340 |
7 | 2613606546155004 |
oct | 307450637464434 |
9 | 53503755084726 |
10 | 13715013265692 |
11 | 4408560491092 |
12 | 165608a239250 |
13 | 78642163750b |
14 | 355b4b205004 |
15 | 18bb5b7c442c |
hex | c79467e691c |
13715013265692 has 24 divisors (see below), whose sum is σ = 32045356163856. Its totient is φ = 4565434153728.
The previous prime is 13715013265691. The next prime is 13715013265771. The reversal of 13715013265692 is 29656231051731.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13715013265691) 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, 779607693 + ... + 779625284.
It is an arithmetic number, because the mean of its divisors is an integer number (1335223173494).
Almost surely, 213715013265692 is an apocalyptic number.
13715013265692 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13715013265692 is an abundant number, since it is smaller than the sum of its proper divisors (18330342898164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13715013265692 is a wasteful number, since it uses less digits than its factorization.
13715013265692 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1559233717 (or 1559233715 counting only the distinct ones).
The product of its (nonzero) digits is 2041200, while the sum is 51.
The spelling of 13715013265692 in words is "thirteen trillion, seven hundred fifteen billion, thirteen million, two hundred sixty-five thousand, six hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •