Base | Representation |
---|---|
bin | 1100101000101010110… |
… | …10101110101000111101 |
3 | 1112111121201202012110111 |
4 | 12110111122232220331 |
5 | 24103120130301323 |
6 | 531240215110021 |
7 | 43236444553123 |
oct | 6242532565075 |
9 | 1474551665414 |
10 | 434151025213 |
11 | 158138a32084 |
12 | 70184372311 |
13 | 31c2b9c2579 |
14 | 17027a35913 |
15 | b45eb7ac0d |
hex | 65156aea3d |
434151025213 has 4 divisors (see below), whose sum is σ = 453027156768. Its totient is φ = 415274893660.
The previous prime is 434151025207. The next prime is 434151025229. The reversal of 434151025213 is 312520151434.
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 434151025213 - 217 = 434150894141 is a prime.
It is a super-2 number, since 2×4341510252132 (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 (434151025313) 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, 9438065743 + ... + 9438065788.
It is an arithmetic number, because the mean of its divisors is an integer number (113256789192).
Almost surely, 2434151025213 is an apocalyptic number.
It is an amenable number.
434151025213 is a deficient number, since it is larger than the sum of its proper divisors (18876131555).
434151025213 is a wasteful number, since it uses less digits than its factorization.
434151025213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18876131554.
The product of its (nonzero) digits is 14400, while the sum is 31.
Adding to 434151025213 its reverse (312520151434), we get a palindrome (746671176647).
The spelling of 434151025213 in words is "four hundred thirty-four billion, one hundred fifty-one million, twenty-five thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •