Base | Representation |
---|---|
bin | 1001111001111100000… |
… | …01100011011110010111 |
3 | 1012112111002102100011222 |
4 | 10330332001203132113 |
5 | 21034010302324343 |
6 | 420203523520555 |
7 | 33406005602015 |
oct | 4747601433627 |
9 | 1175432370158 |
10 | 340343011223 |
11 | 12137a836796 |
12 | 55b6422915b |
13 | 2612bc8b297 |
14 | 126890bb8b5 |
15 | 8cbe34da68 |
hex | 4f3e063797 |
340343011223 has 4 divisors (see below), whose sum is σ = 343465424280. Its totient is φ = 337220598168.
The previous prime is 340343011171. The next prime is 340343011241. The reversal of 340343011223 is 322110343043.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 322110343043 = 30323 ⋅10622641.
It is a cyclic number.
It is not a de Polignac number, because 340343011223 - 236 = 271623534487 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 340343011192 and 340343011201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (340343001223) 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, 1561206365 + ... + 1561206582.
It is an arithmetic number, because the mean of its divisors is an integer number (85866356070).
Almost surely, 2340343011223 is an apocalyptic number.
340343011223 is a deficient number, since it is larger than the sum of its proper divisors (3122413057).
340343011223 is a wasteful number, since it uses less digits than its factorization.
340343011223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3122413056.
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 340343011223 its reverse (322110343043), we get a palindrome (662453354266).
The spelling of 340343011223 in words is "three hundred forty billion, three hundred forty-three million, eleven thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •