Base | Representation |
---|---|
bin | 1001110000110101101101… |
… | …10001100001111111011001 |
3 | 2211000110001100001122212011 |
4 | 10320122312301201333121 |
5 | 10303223123110424001 |
6 | 113354511034345521 |
7 | 4344051406222402 |
oct | 470326661417731 |
9 | 84013040048764 |
10 | 21469312983001 |
11 | 69280a2525354 |
12 | 24a8a9158b2a1 |
13 | bc9716bc0400 |
14 | 5431981249a9 |
15 | 2736ed14ad51 |
hex | 1386b6c61fd9 |
21469312983001 has 27 divisors (see below), whose sum is σ = 23639241492477. Its totient is φ = 19489608833760.
The previous prime is 21469312982981. The next prime is 21469312983061. The reversal of 21469312983001 is 10038921396412.
The square root of 21469312983001 is 4633499.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 15097848504025 + 6371464478976 = 3885595^2 + 2524176^2 .
It is a de Polignac number, because none of the positive numbers 2k-21469312983001 is a prime.
It is not an unprimeable number, because it can be changed into a prime (21469312983061) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 3674361786 + ... + 3674367628.
Almost surely, 221469312983001 is an apocalyptic number.
21469312983001 is the 4633499-th square number.
21469312983001 is the 2316750-th centered octagonal number.
It is an amenable number.
21469312983001 is a deficient number, since it is larger than the sum of its proper divisors (2169928509476).
21469312983001 is an frugal number, since it uses more digits than its factorization.
21469312983001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11834 (or 5917 counting only the distinct ones).
The product of its (nonzero) digits is 559872, while the sum is 49.
The spelling of 21469312983001 in words is "twenty-one trillion, four hundred sixty-nine billion, three hundred twelve million, nine hundred eighty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •