Base | Representation |
---|---|
bin | 10011111110000000… |
… | …011100111000001011 |
3 | 2001100021202222210012 |
4 | 103332000130320023 |
5 | 322402444302311 |
6 | 13503335342135 |
7 | 1356223616141 |
oct | 237600347013 |
9 | 61307688705 |
10 | 21441400331 |
11 | 910312546a |
12 | 41a482194b |
13 | 20391c0440 |
14 | 10758d3591 |
15 | 85758c78b |
hex | 4fe01ce0b |
21441400331 has 64 divisors (see below), whose sum is σ = 26274834432. Its totient is φ = 17290893312.
The previous prime is 21441400283. The next prime is 21441400339. The reversal of 21441400331 is 13300414412.
It is a cyclic number.
It is not a de Polignac number, because 21441400331 - 214 = 21441383947 is a prime.
It is a super-2 number, since 2×214414003312 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a junction number, because it is equal to n+sod(n) for n = 21441400297 and 21441400306.
It is not an unprimeable number, because it can be changed into a prime (21441400339) 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 63 ways as a sum of consecutive naturals, for example, 57483461 + ... + 57483833.
It is an arithmetic number, because the mean of its divisors is an integer number (410544288).
Almost surely, 221441400331 is an apocalyptic number.
21441400331 is a deficient number, since it is larger than the sum of its proper divisors (4833434101).
21441400331 is a wasteful number, since it uses less digits than its factorization.
21441400331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 732.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 21441400331 its reverse (13300414412), we get a palindrome (34741814743).
The spelling of 21441400331 in words is "twenty-one billion, four hundred forty-one million, four hundred thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •