Base | Representation |
---|---|
bin | 11100001111101110… |
… | …10111110001000001 |
3 | 1110010211101100120212 |
4 | 32013313113301001 |
5 | 222024032410223 |
6 | 10544424243505 |
7 | 1044533526422 |
oct | 160767276101 |
9 | 43124340525 |
10 | 15164341313 |
11 | 648196a090 |
12 | 2b32610595 |
13 | 15788c9834 |
14 | a3bda3649 |
15 | 5db478278 |
hex | 387dd7c41 |
15164341313 has 16 divisors (see below), whose sum is σ = 17517911040. Its totient is φ = 12981963600.
The previous prime is 15164341307. The next prime is 15164341333. The reversal of 15164341313 is 31314346151.
It is a cyclic number.
It is not a de Polignac number, because 15164341313 - 212 = 15164337217 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 15164341313.
It is not an unprimeable number, because it can be changed into a prime (15164341333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 182333 + ... + 252138.
It is an arithmetic number, because the mean of its divisors is an integer number (1094869440).
Almost surely, 215164341313 is an apocalyptic number.
It is an amenable number.
15164341313 is a deficient number, since it is larger than the sum of its proper divisors (2353569727).
15164341313 is a wasteful number, since it uses less digits than its factorization.
15164341313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 434668.
The product of its digits is 12960, while the sum is 32.
Adding to 15164341313 its reverse (31314346151), we get a palindrome (46478687464).
The spelling of 15164341313 in words is "fifteen billion, one hundred sixty-four million, three hundred forty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •