Base | Representation |
---|---|
bin | 11000001111100011… |
… | …10010100111010001 |
3 | 1020121001202120010010 |
4 | 30013301302213101 |
5 | 203123420113034 |
6 | 5551301025133 |
7 | 640351013226 |
oct | 140761624721 |
9 | 36531676103 |
10 | 13015394769 |
11 | 557993a803 |
12 | 26329b51a9 |
13 | 12c5631c30 |
14 | 8b681594d |
15 | 5129933e9 |
hex | 307c729d1 |
13015394769 has 32 divisors (see below), whose sum is σ = 19840705920. Its totient is φ = 7518292992.
The previous prime is 13015394713. The next prime is 13015394779. The reversal of 13015394769 is 96749351031.
13015394769 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 13015394769 - 215 = 13015362001 is a prime.
It is a super-2 number, since 2×130153947692 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (13015394779) 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, 225379 + ... + 277175.
It is an arithmetic number, because the mean of its divisors is an integer number (620022060).
Almost surely, 213015394769 is an apocalyptic number.
It is an amenable number.
13015394769 is a deficient number, since it is larger than the sum of its proper divisors (6825311151).
13015394769 is a wasteful number, since it uses less digits than its factorization.
13015394769 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52209.
The product of its (nonzero) digits is 612360, while the sum is 48.
The spelling of 13015394769 in words is "thirteen billion, fifteen million, three hundred ninety-four thousand, seven hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •