Base | Representation |
---|---|
bin | 1111011001101100… |
… | …1100001101010111 |
3 | 101200010110101000020 |
4 | 3312123030031113 |
5 | 31431341314111 |
6 | 1522124520223 |
7 | 204311110626 |
oct | 36633141527 |
9 | 11603411006 |
10 | 4134323031 |
11 | 18317990a3 |
12 | 9746b0073 |
13 | 50b6c1ab7 |
14 | 2b311b6bd |
15 | 192e59906 |
hex | f66cc357 |
4134323031 has 32 divisors (see below), whose sum is σ = 5872124160. Its totient is φ = 2579982336.
The previous prime is 4134323023. The next prime is 4134323051. The reversal of 4134323031 is 1303234314.
It is not a de Polignac number, because 4134323031 - 23 = 4134323023 is a prime.
It is a super-2 number, since 2×41343230312 = 34185253849314053922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4134322992 and 4134323010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4134323051) 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 31 ways as a sum of consecutive naturals, for example, 3396535 + ... + 3397751.
It is an arithmetic number, because the mean of its divisors is an integer number (183503880).
Almost surely, 24134323031 is an apocalyptic number.
4134323031 is a deficient number, since it is larger than the sum of its proper divisors (1737801129).
4134323031 is a wasteful number, since it uses less digits than its factorization.
4134323031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1903.
The product of its (nonzero) digits is 2592, while the sum is 24.
The square root of 4134323031 is about 64298.7016276379. The cubic root of 4134323031 is about 1604.9744959603.
Adding to 4134323031 its reverse (1303234314), we get a palindrome (5437557345).
The spelling of 4134323031 in words is "four billion, one hundred thirty-four million, three hundred twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •