Base | Representation |
---|---|
bin | 1010000010111000010… |
… | …01101000100111011101 |
3 | 1012222212122020000202021 |
4 | 11001130021220213131 |
5 | 21123323203210323 |
6 | 422320125100141 |
7 | 33635655415054 |
oct | 5013411504735 |
9 | 1188778200667 |
10 | 345143413213 |
11 | 123413505865 |
12 | 56a839b7651 |
13 | 26715673831 |
14 | 129c286339b |
15 | 8ea09ca05d |
hex | 505c2689dd |
345143413213 has 4 divisors (see below), whose sum is σ = 345350459520. Its totient is φ = 344936366908.
The previous prime is 345143413193. The next prime is 345143413249. The reversal of 345143413213 is 312314341543.
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: 312314341543 = 106859 ⋅2922677.
It is a cyclic number.
It is not a de Polignac number, because 345143413213 - 233 = 336553478621 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 (345143413273) 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, 103520653 + ... + 103523986.
It is an arithmetic number, because the mean of its divisors is an integer number (86337614880).
Almost surely, 2345143413213 is an apocalyptic number.
It is an amenable number.
345143413213 is a deficient number, since it is larger than the sum of its proper divisors (207046307).
345143413213 is a wasteful number, since it uses less digits than its factorization.
345143413213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 207046306.
The product of its digits is 51840, while the sum is 34.
Adding to 345143413213 its reverse (312314341543), we get a palindrome (657457754756).
The spelling of 345143413213 in words is "three hundred forty-five billion, one hundred forty-three million, four hundred thirteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •