Base | Representation |
---|---|
bin | 1010000000111110101… |
… | …01001011110111101111 |
3 | 1012220020112012020112022 |
4 | 11000133111023313233 |
5 | 21114230443443043 |
6 | 422030554500355 |
7 | 33601455333632 |
oct | 5003725136757 |
9 | 1186215166468 |
10 | 344123031023 |
11 | 122a3a5305a2 |
12 | 5683a1346bb |
13 | 265b214b2a5 |
14 | 1292712bc19 |
15 | 8e4111e868 |
hex | 501f54bdef |
344123031023 has 8 divisors (see below), whose sum is σ = 347549622480. Its totient is φ = 340696820800.
The previous prime is 344123030989. The next prime is 344123031037. The reversal of 344123031023 is 320130321443.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 344123031023 - 26 = 344123030959 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 344123030983 and 344123031001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (344123031523) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1932611 + ... + 2103147.
It is an arithmetic number, because the mean of its divisors is an integer number (43443702810).
Almost surely, 2344123031023 is an apocalyptic number.
344123031023 is a deficient number, since it is larger than the sum of its proper divisors (3426591457).
344123031023 is a wasteful number, since it uses less digits than its factorization.
344123031023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 190617.
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 344123031023 its reverse (320130321443), we get a palindrome (664253352466).
The spelling of 344123031023 in words is "three hundred forty-four billion, one hundred twenty-three million, thirty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •