Base | Representation |
---|---|
bin | 1100000100001111110100… |
… | …1100011010010100010000 |
3 | 1201222022201111020220110121 |
4 | 3001003331030122110100 |
5 | 3214332013331233331 |
6 | 44114454052240024 |
7 | 2536342163651032 |
oct | 301037514322420 |
9 | 51868644226417 |
10 | 13267106899216 |
11 | 4255603a76585 |
12 | 15a3307310014 |
13 | 75310cc28581 |
14 | 33c1ba7c1c52 |
15 | 180194241c11 |
hex | c10fd31a510 |
13267106899216 has 45 divisors (see below), whose sum is σ = 25770024558831. Its totient is φ = 6616820245632.
The previous prime is 13267106899183. The next prime is 13267106899223. The reversal of 13267106899216 is 61299860176231.
The square root of 13267106899216 is 3642404.
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 7970480825616 + 5296626073600 = 2823204^2 + 2301440^2 .
It is a super-2 number, since 2×132671068992162 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 7415933650 + ... + 7415935438.
Almost surely, 213267106899216 is an apocalyptic number.
13267106899216 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
13267106899216 is the 3642404-th square number.
It is an amenable number.
13267106899216 is a deficient number, since it is larger than the sum of its proper divisors (12502917659615).
13267106899216 is an frugal number, since it uses more digits than its factorization.
13267106899216 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4604 (or 2300 counting only the distinct ones).
The product of its (nonzero) digits is 11757312, while the sum is 61.
The spelling of 13267106899216 in words is "thirteen trillion, two hundred sixty-seven billion, one hundred six million, eight hundred ninety-nine thousand, two hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •