Base | Representation |
---|---|
bin | 1011010100010101100011… |
… | …1010100100000000010001 |
3 | 1122001122011120222220020020 |
4 | 2311011120322210000101 |
5 | 3112340314033101340 |
6 | 42244411124134053 |
7 | 2423023134533046 |
oct | 265053072440021 |
9 | 48048146886206 |
10 | 12444012003345 |
11 | 3a685263a778a |
12 | 148b896537329 |
13 | 6c3608345550 |
14 | 3104171091cd |
15 | 168a6d6479d0 |
hex | b5158ea4011 |
12444012003345 has 32 divisors (see below), whose sum is σ = 21743989795584. Its totient is φ = 6039997152000.
The previous prime is 12444012003331. The next prime is 12444012003347. The reversal of 12444012003345 is 54330021044421.
It is not a de Polignac number, because 12444012003345 - 213 = 12444011995153 is a prime.
It is not an unprimeable number, because it can be changed into a prime (12444012003347) 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 31 ways as a sum of consecutive naturals, for example, 449390706 + ... + 449418395.
It is an arithmetic number, because the mean of its divisors is an integer number (679499681112).
Almost surely, 212444012003345 is an apocalyptic number.
12444012003345 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
12444012003345 is a deficient number, since it is larger than the sum of its proper divisors (9299977792239).
12444012003345 is a wasteful number, since it uses less digits than its factorization.
12444012003345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 898809193.
The product of its (nonzero) digits is 46080, while the sum is 33.
Adding to 12444012003345 its reverse (54330021044421), we get a palindrome (66774033047766).
The spelling of 12444012003345 in words is "twelve trillion, four hundred forty-four billion, twelve million, three thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •