Base | Representation |
---|---|
bin | 11111101101100010… |
… | …111100010111010101 |
3 | 10020220000022220012021 |
4 | 133231202330113111 |
5 | 1024213313201123 |
6 | 23350432253141 |
7 | 2313536225104 |
oct | 375542742725 |
9 | 106800286167 |
10 | 34050131413 |
11 | 13493458781 |
12 | 67233a11b1 |
13 | 32984b996c |
14 | 19102cc03b |
15 | d444a2c5d |
hex | 7ed8bc5d5 |
34050131413 has 4 divisors (see below), whose sum is σ = 34238253868. Its totient is φ = 33862008960.
The previous prime is 34050131411. The next prime is 34050131441. The reversal of 34050131413 is 31413105043.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 6528316804 + 27521814609 = 80798^2 + 165897^2 .
It is a cyclic number.
It is not a de Polignac number, because 34050131413 - 21 = 34050131411 is a prime.
It is a super-2 number, since 2×340501314132 (a number of 22 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 (34050131411) 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, 94060956 + ... + 94061317.
It is an arithmetic number, because the mean of its divisors is an integer number (8559563467).
Almost surely, 234050131413 is an apocalyptic number.
It is an amenable number.
34050131413 is a deficient number, since it is larger than the sum of its proper divisors (188122455).
34050131413 is a wasteful number, since it uses less digits than its factorization.
34050131413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 188122454.
The product of its (nonzero) digits is 2160, while the sum is 25.
Adding to 34050131413 its reverse (31413105043), we get a palindrome (65463236456).
The spelling of 34050131413 in words is "thirty-four billion, fifty million, one hundred thirty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •