Base | Representation |
---|---|
bin | 1010000011011110010… |
… | …11010000010101001011 |
3 | 1020000200212211122202011 |
4 | 11001233023100111023 |
5 | 21130001411331011 |
6 | 422411530320351 |
7 | 33646612456540 |
oct | 5015713202513 |
9 | 1200625748664 |
10 | 345462605131 |
11 | 1235676a8436 |
12 | 56b528890b7 |
13 | 26766830ca7 |
14 | 12a12dd0bc7 |
15 | 8ebda2a621 |
hex | 506f2d054b |
345462605131 has 4 divisors (see below), whose sum is σ = 394814405872. Its totient is φ = 296110804392.
The previous prime is 345462605099. The next prime is 345462605161. The reversal of 345462605131 is 131506264543.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 131506264543 = 19121 ⋅6877583.
It is a cyclic number.
It is not a de Polignac number, because 345462605131 - 25 = 345462605099 is a prime.
It is a super-2 number, since 2×3454626051312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (345462605161) 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, 24675900360 + ... + 24675900373.
It is an arithmetic number, because the mean of its divisors is an integer number (98703601468).
Almost surely, 2345462605131 is an apocalyptic number.
345462605131 is a deficient number, since it is larger than the sum of its proper divisors (49351800741).
345462605131 is an equidigital number, since it uses as much as digits as its factorization.
345462605131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49351800740.
The product of its (nonzero) digits is 259200, while the sum is 40.
Adding to 345462605131 its reverse (131506264543), we get a palindrome (476968869674).
The spelling of 345462605131 in words is "three hundred forty-five billion, four hundred sixty-two million, six hundred five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •