Base | Representation |
---|---|
bin | 1010000100111011110… |
… | …00001101001000000101 |
3 | 1020002201111012101002201 |
4 | 11002131320031020011 |
5 | 21133103002443141 |
6 | 423021400234501 |
7 | 34005205430146 |
oct | 5023570151005 |
9 | 1202644171081 |
10 | 346246140421 |
11 | 123929a13065 |
12 | 5713116ba31 |
13 | 2685cc6a93c |
14 | 12a890b1acd |
15 | 90176ee031 |
hex | 509de0d205 |
346246140421 has 4 divisors (see below), whose sum is σ = 348247563372. Its totient is φ = 344244717472.
The previous prime is 346246140377. The next prime is 346246140433. The reversal of 346246140421 is 124041642643.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 124041642643 = 127291 ⋅974473.
It can be written as a sum of positive squares in 2 ways, for example, as 320095692900 + 26150447521 = 565770^2 + 161711^2 .
It is a cyclic number.
It is not a de Polignac number, because 346246140421 - 217 = 346246009349 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 (346246180421) 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, 1000711216 + ... + 1000711561.
It is an arithmetic number, because the mean of its divisors is an integer number (87061890843).
Almost surely, 2346246140421 is an apocalyptic number.
It is an amenable number.
346246140421 is a deficient number, since it is larger than the sum of its proper divisors (2001422951).
346246140421 is a wasteful number, since it uses less digits than its factorization.
346246140421 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2001422950.
The product of its (nonzero) digits is 110592, while the sum is 37.
The spelling of 346246140421 in words is "three hundred forty-six billion, two hundred forty-six million, one hundred forty thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •