Base | Representation |
---|---|
bin | 10100111111001100011… |
… | …110001111100100101011 |
3 | 12002212200111111222112010 |
4 | 110333030132033210223 |
5 | 142112204044234311 |
6 | 3022320305251003 |
7 | 206125110120402 |
oct | 24771436174453 |
9 | 5085614458463 |
10 | 1442244524331 |
11 | 50671a486716 |
12 | 1b3624933a63 |
13 | a60069a9a30 |
14 | 4db3ad24639 |
15 | 277b1c0ada6 |
hex | 14fcc78f92b |
1442244524331 has 16 divisors (see below), whose sum is σ = 2072889453600. Its totient is φ = 886688989440.
The previous prime is 1442244524321. The next prime is 1442244524339. The reversal of 1442244524331 is 1334254422441.
It is not a de Polignac number, because 1442244524331 - 25 = 1442244524299 is a prime.
It is a super-2 number, since 2×14422445243312 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a self number, because there is not a number n which added to its sum of digits gives 1442244524331.
It is not an unprimeable number, because it can be changed into a prime (1442244524339) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17585700 + ... + 17667521.
It is an arithmetic number, because the mean of its divisors is an integer number (129555590850).
Almost surely, 21442244524331 is an apocalyptic number.
1442244524331 is a deficient number, since it is larger than the sum of its proper divisors (630644929269).
1442244524331 is a wasteful number, since it uses less digits than its factorization.
1442244524331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35254286.
The product of its digits is 368640, while the sum is 39.
Adding to 1442244524331 its reverse (1334254422441), we get a palindrome (2776498946772).
The spelling of 1442244524331 in words is "one trillion, four hundred forty-two billion, two hundred forty-four million, five hundred twenty-four thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •