Base | Representation |
---|---|
bin | 11000011111101000… |
… | …01100000010110111 |
3 | 1020221110111110022011 |
4 | 30033310030002313 |
5 | 203412430202301 |
6 | 10012515145051 |
7 | 643606126621 |
oct | 141764140267 |
9 | 36843443264 |
10 | 13150240951 |
11 | 5638a71731 |
12 | 266bba5187 |
13 | 1317556483 |
14 | 8ca6b7c11 |
15 | 51e72ca51 |
hex | 30fd0c0b7 |
13150240951 has 32 divisors (see below), whose sum is σ = 14297643008. Its totient is φ = 12070840320.
The previous prime is 13150240937. The next prime is 13150240991. The reversal of 13150240951 is 15904205131.
13150240951 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a 11-Lehmer number, since φ(13150240951) divides (13150240951-1)11.
It is a cyclic number.
It is not a de Polignac number, because 13150240951 - 25 = 13150240919 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is the 114675-th Hogben number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13150240991) 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, 6518695 + ... + 6520711.
It is an arithmetic number, because the mean of its divisors is an integer number (446801344).
Almost surely, 213150240951 is an apocalyptic number.
13150240951 is a deficient number, since it is larger than the sum of its proper divisors (1147402057).
13150240951 is a wasteful number, since it uses less digits than its factorization.
13150240951 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2231.
The product of its (nonzero) digits is 5400, while the sum is 31.
The spelling of 13150240951 in words is "thirteen billion, one hundred fifty million, two hundred forty thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •