Base | Representation |
---|---|
bin | 11111101011001010… |
… | …010100010100101001 |
3 | 10020210020001011221010 |
4 | 133223022110110221 |
5 | 1024123042342023 |
6 | 23342442534133 |
7 | 2312542156134 |
oct | 375312242451 |
9 | 106706034833 |
10 | 34010121513 |
11 | 13472910745 |
12 | 6711b07349 |
13 | 329011b774 |
14 | 1908c7521b |
15 | d40bed093 |
hex | 7eb294529 |
34010121513 has 4 divisors (see below), whose sum is σ = 45346828688. Its totient is φ = 22673414340.
The previous prime is 34010121503. The next prime is 34010121527. The reversal of 34010121513 is 31512101043.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 31512101043 = 3 ⋅10504033681.
It is not a de Polignac number, because 34010121513 - 210 = 34010120489 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 34010121513.
It is not an unprimeable number, because it can be changed into a prime (34010121503) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5668353583 + ... + 5668353588.
It is an arithmetic number, because the mean of its divisors is an integer number (11336707172).
Almost surely, 234010121513 is an apocalyptic number.
It is an amenable number.
34010121513 is a deficient number, since it is larger than the sum of its proper divisors (11336707175).
34010121513 is a wasteful number, since it uses less digits than its factorization.
34010121513 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11336707174.
The product of its (nonzero) digits is 360, while the sum is 21.
Adding to 34010121513 its reverse (31512101043), we get a palindrome (65522222556).
The spelling of 34010121513 in words is "thirty-four billion, ten million, one hundred twenty-one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •