Base | Representation |
---|---|
bin | 101101011100101111110… |
… | …111111011001000000011 |
3 | 102001120122021101011111102 |
4 | 231130233313323020003 |
5 | 402132401032212233 |
6 | 10350444303005015 |
7 | 441434623325600 |
oct | 55345767731003 |
9 | 12046567334442 |
10 | 3123244413443 |
11 | aa4619059720 |
12 | 42538029976b |
13 | 19869cc3642b |
14 | ab2470a96a7 |
15 | 5639946c1e8 |
hex | 2d72fdfb203 |
3123244413443 has 12 divisors (see below), whose sum is σ = 3963449311992. Its totient is φ = 2433696945120.
The previous prime is 3123244413439. The next prime is 3123244413463. The reversal of 3123244413443 is 3443144423213.
It is not a de Polignac number, because 3123244413443 - 22 = 3123244413439 is a prime.
It is a super-2 number, since 2×31232444134432 (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 = 3123244413397 and 3123244413406.
It is not an unprimeable number, because it can be changed into a prime (3123244413403) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2897257730 + ... + 2897258807.
It is an arithmetic number, because the mean of its divisors is an integer number (330287442666).
Almost surely, 23123244413443 is an apocalyptic number.
3123244413443 is a deficient number, since it is larger than the sum of its proper divisors (840204898549).
3123244413443 is a wasteful number, since it uses less digits than its factorization.
3123244413443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5794516562 (or 5794516555 counting only the distinct ones).
The product of its digits is 331776, while the sum is 38.
Adding to 3123244413443 its reverse (3443144423213), we get a palindrome (6566388836656).
The spelling of 3123244413443 in words is "three trillion, one hundred twenty-three billion, two hundred forty-four million, four hundred thirteen thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.325 sec. • engine limits •