Base | Representation |
---|---|
bin | 1110111101001100100111… |
… | …0001100011110110110111 |
3 | 2011020002011212121120222001 |
4 | 3233103021301203312313 |
5 | 4123411334111141211 |
6 | 54550301434520131 |
7 | 3315035351606365 |
oct | 357231161436667 |
9 | 64202155546861 |
10 | 16444520021431 |
11 | 5270099931907 |
12 | 1a17084596047 |
13 | 9239334727a8 |
14 | 40bcc1aca635 |
15 | 1d7b5e001ac1 |
hex | ef4c9c63db7 |
16444520021431 has 8 divisors (see below), whose sum is σ = 17451507252960. Its totient is φ = 15441939737088.
The previous prime is 16444520021429. The next prime is 16444520021443. The reversal of 16444520021431 is 13412002544461.
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 16444520021431 - 21 = 16444520021429 is a prime.
It is a super-2 number, since 2×164445200214312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16444520021731) 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, 1101729106 + ... + 1101744031.
It is an arithmetic number, because the mean of its divisors is an integer number (2181438406620).
Almost surely, 216444520021431 is an apocalyptic number.
16444520021431 is a deficient number, since it is larger than the sum of its proper divisors (1006987231529).
16444520021431 is a wasteful number, since it uses less digits than its factorization.
16444520021431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2203473593.
The product of its (nonzero) digits is 92160, while the sum is 37.
Adding to 16444520021431 its reverse (13412002544461), we get a palindrome (29856522565892).
The spelling of 16444520021431 in words is "sixteen trillion, four hundred forty-four billion, five hundred twenty million, twenty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •