Base | Representation |
---|---|
bin | 1100010001100101111110… |
… | …0001111011000000000000 |
3 | 1202210020112121210211001002 |
4 | 3010121133201323000000 |
5 | 3232111101313100333 |
6 | 44412053404231132 |
7 | 2562040060632011 |
oct | 304313741730000 |
9 | 52706477724032 |
10 | 13496389971968 |
11 | 433387231a752 |
12 | 161b83583b4a8 |
13 | 76b91cc24817 |
14 | 34932ba09008 |
15 | 1861133c70e8 |
hex | c465f87b000 |
13496389971968 has 156 divisors (see below), whose sum is σ = 27669140400888. Its totient is φ = 6581465579520.
The previous prime is 13496389971959. The next prime is 13496389971983. The reversal of 13496389971968 is 86917998369431.
It is a Smith number, since the sum of its digits (83) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (83).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2121737108 + ... + 2121743468.
Almost surely, 213496389971968 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13496389971968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13834570200444).
13496389971968 is an abundant number, since it is smaller than the sum of its proper divisors (14172750428920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13496389971968 is an frugal number, since it uses more digits than its factorization.
13496389971968 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6626 (or 6525 counting only the distinct ones).
The product of its digits is 3809369088, while the sum is 83.
The spelling of 13496389971968 in words is "thirteen trillion, four hundred ninety-six billion, three hundred eighty-nine million, nine hundred seventy-one thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •