Base | Representation |
---|---|
bin | 11001000001011111… |
… | …10010111001001111 |
3 | 1021200021000020211220 |
4 | 30200233302321033 |
5 | 210003140131111 |
6 | 10101023414423 |
7 | 653625453213 |
oct | 144057627117 |
9 | 37607006756 |
10 | 13434302031 |
11 | 5774349a57 |
12 | 272b154413 |
13 | 1361363457 |
14 | 9162dc943 |
15 | 53963de06 |
hex | 320bf2e4f |
13434302031 has 8 divisors (see below), whose sum is σ = 17917536000. Its totient is φ = 8953634712.
The previous prime is 13434301987. The next prime is 13434302083. The reversal of 13434302031 is 13020343431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13434302031 - 213 = 13434293839 is a prime.
It is a super-2 number, since 2×134343020312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13434301992 and 13434302010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13434302131) 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 7 ways as a sum of consecutive naturals, for example, 629415 + ... + 650408.
It is an arithmetic number, because the mean of its divisors is an integer number (2239692000).
Almost surely, 213434302031 is an apocalyptic number.
13434302031 is a deficient number, since it is larger than the sum of its proper divisors (4483233969).
13434302031 is a wasteful number, since it uses less digits than its factorization.
13434302031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1283325.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 13434302031 its reverse (13020343431), we get a palindrome (26454645462).
The spelling of 13434302031 in words is "thirteen billion, four hundred thirty-four million, three hundred two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •