Base | Representation |
---|---|
bin | 1010000000111101011… |
… | …11010110001111011111 |
3 | 1012220012211112022020020 |
4 | 11000132233112033133 |
5 | 21114220424041111 |
6 | 422030002123223 |
7 | 33601305122403 |
oct | 5003657261737 |
9 | 1186184468206 |
10 | 344113112031 |
11 | 122a34976287 |
12 | 56836950513 |
13 | 265b0087570 |
14 | 12925aa9103 |
15 | 8e40310906 |
hex | 501ebd63df |
344113112031 has 64 divisors (see below), whose sum is σ = 512234900352. Its totient is φ = 204155707392.
The previous prime is 344113112003. The next prime is 344113112033. The reversal of 344113112031 is 130211311443.
It is a happy number.
It is not a de Polignac number, because 344113112031 - 29 = 344113111519 is a prime.
It is a super-2 number, since 2×3441131120312 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 344113111992 and 344113112010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (344113112033) 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 63 ways as a sum of consecutive naturals, for example, 41792691 + ... + 41800923.
It is an arithmetic number, because the mean of its divisors is an integer number (8003670318).
Almost surely, 2344113112031 is an apocalyptic number.
344113112031 is a deficient number, since it is larger than the sum of its proper divisors (168121788321).
344113112031 is a wasteful number, since it uses less digits than its factorization.
344113112031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8652.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 344113112031 its reverse (130211311443), we get a palindrome (474324423474).
The spelling of 344113112031 in words is "three hundred forty-four billion, one hundred thirteen million, one hundred twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •