Base | Representation |
---|---|
bin | 1100011101011000010000… |
… | …0101000110000111000100 |
3 | 1210111121011120101000210111 |
4 | 3013112010011012013010 |
5 | 3243420234324311304 |
6 | 45045101130002404 |
7 | 2612465454110362 |
oct | 307260405060704 |
9 | 53447146330714 |
10 | 13698866635204 |
11 | 44017250a5673 |
12 | 1652b22876404 |
13 | 784a4a391caa |
14 | 3550589c4632 |
15 | 18b513eb7704 |
hex | c75841461c4 |
13698866635204 has 27 divisors (see below), whose sum is σ = 24101674454221. Its totient is φ = 6812869182560.
The previous prime is 13698866635177. The next prime is 13698866635243. The reversal of 13698866635204 is 40253666889631.
The square root of 13698866635204 is 3701198.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 7646873028804 + 6051993606400 = 2765298^2 + 2460080^2 .
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13698866635204.
It is an unprimeable number.
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 8 ways as a sum of consecutive naturals, for example, 1413852792 + ... + 1413862480.
Almost surely, 213698866635204 is an apocalyptic number.
13698866635204 is the 3701198-th square number.
It is an amenable number.
13698866635204 is a deficient number, since it is larger than the sum of its proper divisors (10402807819017).
13698866635204 is an frugal number, since it uses more digits than its factorization.
13698866635204 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19764 (or 9882 counting only the distinct ones).
The product of its (nonzero) digits is 268738560, while the sum is 67.
The spelling of 13698866635204 in words is "thirteen trillion, six hundred ninety-eight billion, eight hundred sixty-six million, six hundred thirty-five thousand, two hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •