Base | Representation |
---|---|
bin | 10011100100110101010… |
… | …111111100110001011011 |
3 | 11202121020201012100222220 |
4 | 103210311113330301123 |
5 | 134020002334444311 |
6 | 2505552522115123 |
7 | 166121545220301 |
oct | 23446527746133 |
9 | 4677221170886 |
10 | 1345220234331 |
11 | 479560830586 |
12 | 19886764baa3 |
13 | 99b1382884c |
14 | 49175186271 |
15 | 24ed3d68206 |
hex | 139355fcc5b |
1345220234331 has 8 divisors (see below), whose sum is σ = 1797069643344. Its totient is φ = 895092157440.
The previous prime is 1345220234291. The next prime is 1345220234333. The reversal of 1345220234331 is 1334320225431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1345220234331 - 27 = 1345220234203 is a prime.
It is a super-2 number, since 2×13452202343312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1345220234292 and 1345220234301.
It is not an unprimeable number, because it can be changed into a prime (1345220234333) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 430331206 + ... + 430334331.
It is an arithmetic number, because the mean of its divisors is an integer number (224633705418).
Almost surely, 21345220234331 is an apocalyptic number.
1345220234331 is a deficient number, since it is larger than the sum of its proper divisors (451849409013).
1345220234331 is an equidigital number, since it uses as much as digits as its factorization.
1345220234331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 860666061.
The product of its (nonzero) digits is 51840, while the sum is 33.
Adding to 1345220234331 its reverse (1334320225431), we get a palindrome (2679540459762).
The spelling of 1345220234331 in words is "one trillion, three hundred forty-five billion, two hundred twenty million, two hundred thirty-four thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •