Base | Representation |
---|---|
bin | 101111001101001101011… |
… | …101111011110001101011 |
3 | 102111010022221022121110001 |
4 | 233031031131323301223 |
5 | 411122203000014011 |
6 | 10522134550203431 |
7 | 453241226021551 |
oct | 57151535736153 |
9 | 12433287277401 |
10 | 3244000001131 |
11 | 104085547aa7a |
12 | 444861053577 |
13 | 1a6ba58236b6 |
14 | b30208d9bd1 |
15 | 595b59257c1 |
hex | 2f34d77bc6b |
3244000001131 has 8 divisors (see below), whose sum is σ = 3299451858144. Its totient is φ = 3188819303040.
The previous prime is 3244000001101. The next prime is 3244000001141. The reversal of 3244000001131 is 1311000004423.
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 3244000001131 - 223 = 3243991612523 is a prime.
It is a super-2 number, since 2×32440000011312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3244000001099 and 3244000001108.
It is not an unprimeable number, because it can be changed into a prime (3244000001101) 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, 67765600 + ... + 67813453.
It is an arithmetic number, because the mean of its divisors is an integer number (412431482268).
Almost surely, 23244000001131 is an apocalyptic number.
3244000001131 is a deficient number, since it is larger than the sum of its proper divisors (55451857013).
3244000001131 is a wasteful number, since it uses less digits than its factorization.
3244000001131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135579461.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 3244000001131 its reverse (1311000004423), we get a palindrome (4555000005554).
The spelling of 3244000001131 in words is "three trillion, two hundred forty-four billion, one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •