Base | Representation |
---|---|
bin | 11000011111110000… |
… | …11010111000110011 |
3 | 1020221112120211002000 |
4 | 30033320122320303 |
5 | 203413221202243 |
6 | 10012555025043 |
7 | 643621430136 |
oct | 141770327063 |
9 | 36845524060 |
10 | 13151350323 |
11 | 563965a171 |
12 | 267043b183 |
13 | 13178543c7 |
14 | 8ca8c621d |
15 | 51e89b5d3 |
hex | 30fe1ae33 |
13151350323 has 16 divisors (see below), whose sum is σ = 19553830560. Its totient is φ = 8735910048.
The previous prime is 13151350321. The next prime is 13151350357. The reversal of 13151350323 is 32305315131.
13151350323 is a `hidden beast` number, since 1 + 3 + 151 + 3 + 503 + 2 + 3 = 666.
It is not a de Polignac number, because 13151350323 - 21 = 13151350321 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (13151350321) 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, 871740 + ... + 886697.
It is an arithmetic number, because the mean of its divisors is an integer number (1222114410).
Almost surely, 213151350323 is an apocalyptic number.
13151350323 is a deficient number, since it is larger than the sum of its proper divisors (6402480237).
13151350323 is a wasteful number, since it uses less digits than its factorization.
13151350323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1758723 (or 1758717 counting only the distinct ones).
The product of its (nonzero) digits is 4050, while the sum is 27.
Adding to 13151350323 its reverse (32305315131), we get a palindrome (45456665454).
The spelling of 13151350323 in words is "thirteen billion, one hundred fifty-one million, three hundred fifty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •