Base | Representation |
---|---|
bin | 1011101111000111… |
… | …0111111001110111 |
3 | 22010120001120202221 |
4 | 2323301313321313 |
5 | 22423001212211 |
6 | 1240340143211 |
7 | 141033033544 |
oct | 27361677167 |
9 | 8116046687 |
10 | 3150413431 |
11 | 1377365270 |
12 | 73b097b07 |
13 | 3b28c9679 |
14 | 21c59bbcb |
15 | 1368a5c71 |
hex | bbc77e77 |
3150413431 has 32 divisors (see below), whose sum is σ = 3678732288. Its totient is φ = 2669372640.
The previous prime is 3150413411. The next prime is 3150413509. The reversal of 3150413431 is 1343140513.
It is not a de Polignac number, because 3150413431 - 27 = 3150413303 is a prime.
It is a super-2 number, since 2×31504134312 = 19850209572450383522, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3150413396 and 3150413405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3150413411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3650106 + ... + 3650968.
It is an arithmetic number, because the mean of its divisors is an integer number (114960384).
Almost surely, 23150413431 is an apocalyptic number.
3150413431 is a deficient number, since it is larger than the sum of its proper divisors (528318857).
3150413431 is a wasteful number, since it uses less digits than its factorization.
3150413431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1251.
The product of its (nonzero) digits is 2160, while the sum is 25.
The square root of 3150413431 is about 56128.5438168496. The cubic root of 3150413431 is about 1465.9613380673.
Adding to 3150413431 its reverse (1343140513), we get a palindrome (4493553944).
The spelling of 3150413431 in words is "three billion, one hundred fifty million, four hundred thirteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •