Base | Representation |
---|---|
bin | 1010000000110011111… |
… | …10010101001111011101 |
3 | 1012220000021002000110011 |
4 | 11000121332111033131 |
5 | 21114034441412023 |
6 | 422014024243221 |
7 | 33566314362553 |
oct | 5003176251735 |
9 | 1186007060404 |
10 | 344033154013 |
11 | 1229a382367a |
12 | 56814010511 |
13 | 26599640323 |
14 | 12919213bd3 |
15 | 8e382b950d |
hex | 5019f953dd |
344033154013 has 4 divisors (see below), whose sum is σ = 349864224480. Its totient is φ = 338202083548.
The previous prime is 344033153999. The next prime is 344033154079. The reversal of 344033154013 is 310451330443.
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 a de Polignac number, because none of the positive numbers 2k-344033154013 is a prime.
It is a super-2 number, since 2×3440331540132 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (344033151013) 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, 2915535145 + ... + 2915535262.
It is an arithmetic number, because the mean of its divisors is an integer number (87466056120).
Almost surely, 2344033154013 is an apocalyptic number.
It is an amenable number.
344033154013 is a deficient number, since it is larger than the sum of its proper divisors (5831070467).
344033154013 is an equidigital number, since it uses as much as digits as its factorization.
344033154013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5831070466.
The product of its (nonzero) digits is 25920, while the sum is 31.
Adding to 344033154013 its reverse (310451330443), we get a palindrome (654484484456).
The spelling of 344033154013 in words is "three hundred forty-four billion, thirty-three million, one hundred fifty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •