Base | Representation |
---|---|
bin | 11001100000101100… |
… | …00011100011110000 |
3 | 1022100111102101020220 |
4 | 30300112003203300 |
5 | 211022133140000 |
6 | 10143012333040 |
7 | 663253665000 |
oct | 146026034360 |
9 | 38314371226 |
10 | 13695990000 |
11 | 5899036000 |
12 | 27a2914180 |
13 | 13a3638ac4 |
14 | 93cd7c000 |
15 | 5525d11a0 |
hex | 3305838f0 |
13695990000 has 800 divisors, whose sum is σ = 56711846400. Its totient is φ = 2845920000.
The previous prime is 13695989977. The next prime is 13695990029. The reversal of 13695990000 is 9959631.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 1245089995 + ... + 1245090005.
It is an arithmetic number, because the mean of its divisors is an integer number (70889808).
Almost surely, 213695990000 is an apocalyptic number.
13695990000 is a gapful number since it is divisible by the number (10) 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 13695990000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28355923200).
13695990000 is an abundant number, since it is smaller than the sum of its proper divisors (43015856400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13695990000 is an frugal number, since it uses more digits than its factorization.
13695990000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 85 (or 28 counting only the distinct ones).
The product of its (nonzero) digits is 65610, while the sum is 42.
The spelling of 13695990000 in words is "thirteen billion, six hundred ninety-five million, nine hundred ninety thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •