Base | Representation |
---|---|
bin | 1111101001010010101011… |
… | …11101000001100001000001 |
3 | 11111211000001222110201022101 |
4 | 13310221111331001201001 |
5 | 14002134124301220223 |
6 | 201101012243510401 |
7 | 10150421262522130 |
oct | 764512575014101 |
9 | 144730058421271 |
10 | 34404130101313 |
11 | aa6478958a295 |
12 | 3a37901688401 |
13 | 16273ac41a33b |
14 | 86d2511cb917 |
15 | 3e9de50514ad |
hex | 1f4a55f41841 |
34404130101313 has 4 divisors (see below), whose sum is σ = 39319005830080. Its totient is φ = 29489254372548.
The previous prime is 34404130101307. The next prime is 34404130101337. The reversal of 34404130101313 is 31310103140443.
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.
It is a cyclic number.
It is not a de Polignac number, because 34404130101313 - 241 = 32205106845761 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (34404130101413) 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, 2457437864373 + ... + 2457437864386.
It is an arithmetic number, because the mean of its divisors is an integer number (9829751457520).
Almost surely, 234404130101313 is an apocalyptic number.
It is an amenable number.
34404130101313 is a deficient number, since it is larger than the sum of its proper divisors (4914875728767).
34404130101313 is an equidigital number, since it uses as much as digits as its factorization.
34404130101313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4914875728766.
The product of its (nonzero) digits is 5184, while the sum is 28.
Adding to 34404130101313 its reverse (31310103140443), we get a palindrome (65714233241756).
The spelling of 34404130101313 in words is "thirty-four trillion, four hundred four billion, one hundred thirty million, one hundred one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •