Base | Representation |
---|---|
bin | 1001111011010111101… |
… | …11000110000101001001 |
3 | 1012121110200110002201110 |
4 | 10331223313012011021 |
5 | 21042044134140241 |
6 | 420412114240533 |
7 | 33434034224661 |
oct | 4755367060511 |
9 | 1177420402643 |
10 | 341112021321 |
11 | 121734930425 |
12 | 56139886149 |
13 | 262223b0746 |
14 | 1271d29b1a1 |
15 | 8d16b03816 |
hex | 4f6bdc6149 |
341112021321 has 8 divisors (see below), whose sum is σ = 469487513344. Its totient is φ = 220072271760.
The previous prime is 341112021311. The next prime is 341112021337. The reversal of 341112021321 is 123120211143.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 341112021321 - 223 = 341103632713 is a prime.
It is a super-2 number, since 2×3411120213212 (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 (341112021311) 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, 1833935506 + ... + 1833935691.
It is an arithmetic number, because the mean of its divisors is an integer number (58685939168).
Almost surely, 2341112021321 is an apocalyptic number.
341112021321 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
It is an amenable number.
341112021321 is a deficient number, since it is larger than the sum of its proper divisors (128375492023).
341112021321 is a wasteful number, since it uses less digits than its factorization.
341112021321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3667871231.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 341112021321 its reverse (123120211143), we get a palindrome (464232232464).
The spelling of 341112021321 in words is "three hundred forty-one billion, one hundred twelve million, twenty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •