Base | Representation |
---|---|
bin | 11000101010110100… |
… | …01111001101000011 |
3 | 1021012000010001200200 |
4 | 30111122033031003 |
5 | 204110442221233 |
6 | 10030111020243 |
7 | 646126001436 |
oct | 142532171503 |
9 | 37160101620 |
10 | 13244101443 |
11 | 5686a4a491 |
12 | 269750a683 |
13 | 1330b2a621 |
14 | 8d8d4b81d |
15 | 527abd313 |
hex | 31568f343 |
13244101443 has 12 divisors (see below), whose sum is σ = 19309158648. Its totient is φ = 8746882560.
The previous prime is 13244101397. The next prime is 13244101457. The reversal of 13244101443 is 34410144231.
13244101443 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13244101443 - 213 = 13244093251 is a prime.
It is a super-3 number, since 3×132441014433 (a number of 31 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (13244101043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6875518 + ... + 6877443.
It is an arithmetic number, because the mean of its divisors is an integer number (1609096554).
Almost surely, 213244101443 is an apocalyptic number.
13244101443 is a deficient number, since it is larger than the sum of its proper divisors (6065057205).
13244101443 is a wasteful number, since it uses less digits than its factorization.
13244101443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13753074 (or 13753071 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 13244101443 its reverse (34410144231), we get a palindrome (47654245674).
The spelling of 13244101443 in words is "thirteen billion, two hundred forty-four million, one hundred one thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •