Base | Representation |
---|---|
bin | 11000001111011000… |
… | …10111101011000000 |
3 | 1020120222002100202210 |
4 | 30013230113223000 |
5 | 203123034124241 |
6 | 5551210342120 |
7 | 640332644163 |
oct | 140754275300 |
9 | 36528070683 |
10 | 13013973696 |
11 | 557905a069 |
12 | 263242a940 |
13 | 12c5255169 |
14 | 8b6565ada |
15 | 5127b2316 |
hex | 307b17ac0 |
13013973696 has 112 divisors (see below), whose sum is σ = 36295990400. Its totient is φ = 4103903232.
The previous prime is 13013973617. The next prime is 13013973697. The reversal of 13013973696 is 69637931031.
It is a super-2 number, since 2×130139736962 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is not an unprimeable number, because it can be changed into a prime (13013973697) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3131556 + ... + 3135708.
Almost surely, 213013973696 is an apocalyptic number.
13013973696 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13013973696, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18147995200).
13013973696 is an abundant number, since it is smaller than the sum of its proper divisors (23282016704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13013973696 is a wasteful number, since it uses less digits than its factorization.
13013973696 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5046 (or 5036 counting only the distinct ones).
The product of its (nonzero) digits is 551124, while the sum is 48.
The spelling of 13013973696 in words is "thirteen billion, thirteen million, nine hundred seventy-three thousand, six hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •