Base | Representation |
---|---|
bin | 11101010001010010… |
… | …10110001100110101 |
3 | 1111120011020210221002 |
4 | 32220221112030311 |
5 | 224140331004023 |
6 | 11115152133045 |
7 | 1064262312440 |
oct | 165051261465 |
9 | 44504223832 |
10 | 15714313013 |
11 | 6734357a53 |
12 | 3066837185 |
13 | 163582a189 |
14 | a91046657 |
15 | 61e8b2b28 |
hex | 3a8a56335 |
15714313013 has 32 divisors (see below), whose sum is σ = 18672353280. Its totient is φ = 12941280000.
The previous prime is 15714313009. The next prime is 15714313039. The reversal of 15714313013 is 31031341751.
15714313013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 15714313013 - 22 = 15714313009 is a prime.
It is a super-2 number, since 2×157143130132 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15714310013) 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, 36459908 + ... + 36460338.
It is an arithmetic number, because the mean of its divisors is an integer number (583511040).
Almost surely, 215714313013 is an apocalyptic number.
It is an amenable number.
15714313013 is a deficient number, since it is larger than the sum of its proper divisors (2958040267).
15714313013 is a wasteful number, since it uses less digits than its factorization.
15714313013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1289.
The product of its (nonzero) digits is 3780, while the sum is 29.
Adding to 15714313013 its reverse (31031341751), we get a palindrome (46745654764).
The spelling of 15714313013 in words is "fifteen billion, seven hundred fourteen million, three hundred thirteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •