Base | Representation |
---|---|
bin | 11001100001101001… |
… | …00010010001000000 |
3 | 1022101001110022121101 |
4 | 30300310202101000 |
5 | 211031204330341 |
6 | 10143455504144 |
7 | 663411623512 |
oct | 146064422100 |
9 | 38331408541 |
10 | 13703980096 |
11 | 58a25a3094 |
12 | 27a5528054 |
13 | 13a51a5881 |
14 | 94005bbb2 |
15 | 55315d831 |
hex | 330d22440 |
13703980096 has 21 divisors (see below), whose sum is σ = 27195694021. Its totient is φ = 6851521792.
The previous prime is 13703980079. The next prime is 13703980099. The reversal of 13703980096 is 69008930731.
The square root of 13703980096 is 117064.
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., 46785600 + 13657194496 = 6840^2 + 116864^2 .
It is a Smith number, since the sum of its digits (46) coincides with the sum of the digits of its prime factors.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13703980099) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 929196 + ... + 943828.
Almost surely, 213703980096 is an apocalyptic number.
13703980096 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
13703980096 is the 117064-th square number.
It is an amenable number.
13703980096 is a deficient number, since it is larger than the sum of its proper divisors (13491713925).
13703980096 is an frugal number, since it uses more digits than its factorization.
13703980096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29278 (or 14635 counting only the distinct ones).
The product of its (nonzero) digits is 244944, while the sum is 46.
The spelling of 13703980096 in words is "thirteen billion, seven hundred three million, nine hundred eighty thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •