Base | Representation |
---|---|
bin | 101000010111011… |
… | …0000101010001101 |
3 | 10111101121102211011 |
4 | 1100232300222031 |
5 | 10233213411323 |
6 | 342222125221 |
7 | 45364336465 |
oct | 12056605215 |
9 | 3441542734 |
10 | 1354435213 |
11 | 6355a824a |
12 | 319720811 |
13 | 1877b7071 |
14 | cbc50ba5 |
15 | 7dd9420d |
hex | 50bb0a8d |
1354435213 has 4 divisors (see below), whose sum is σ = 1354598208. Its totient is φ = 1354272220.
The previous prime is 1354435163. The next prime is 1354435219. The reversal of 1354435213 is 3125344531.
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: 3125344531 = 1723 ⋅1813897.
It is a cyclic number.
It is not a de Polignac number, because 1354435213 - 229 = 817564301 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1354435219) 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, 68323 + ... + 85888.
It is an arithmetic number, because the mean of its divisors is an integer number (338649552).
Almost surely, 21354435213 is an apocalyptic number.
It is an amenable number.
1354435213 is a deficient number, since it is larger than the sum of its proper divisors (162995).
1354435213 is an equidigital number, since it uses as much as digits as its factorization.
1354435213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 162994.
The product of its digits is 21600, while the sum is 31.
The square root of 1354435213 is about 36802.6522549666. The cubic root of 1354435213 is about 1106.4184572515.
Adding to 1354435213 its reverse (3125344531), we get a palindrome (4479779744).
The spelling of 1354435213 in words is "one billion, three hundred fifty-four million, four hundred thirty-five thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •