Base | Representation |
---|---|
bin | 11010000000110010… |
… | …11110000001000000 |
3 | 1100001021012202220120 |
4 | 31000121132001000 |
5 | 212100110222011 |
6 | 10225433140240 |
7 | 1003034156256 |
oct | 150031360100 |
9 | 40037182816 |
10 | 13965320256 |
11 | 5a17071898 |
12 | 2858b5a680 |
13 | 1417388b14 |
14 | 966a4a5d6 |
15 | 56b082a06 |
hex | 34065e040 |
13965320256 has 112 divisors (see below), whose sum is σ = 38025482496. Its totient is φ = 4520116224.
The previous prime is 13965320249. The next prime is 13965320263. The reversal of 13965320256 is 65202356931.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (13965320249) and next prime (13965320263).
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 4097305 + ... + 4100711.
Almost surely, 213965320256 is an apocalyptic number.
13965320256 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 13965320256, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19012741248).
13965320256 is an abundant number, since it is smaller than the sum of its proper divisors (24060162240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13965320256 is a wasteful number, since it uses less digits than its factorization.
13965320256 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4036 (or 4026 counting only the distinct ones).
The product of its (nonzero) digits is 291600, while the sum is 42.
The spelling of 13965320256 in words is "thirteen billion, nine hundred sixty-five million, three hundred twenty thousand, two hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •