Base | Representation |
---|---|
bin | 11001110101011001… |
… | …00001111100000000 |
3 | 1022210121012102011000 |
4 | 30322230201330000 |
5 | 211401112410020 |
6 | 10212134452000 |
7 | 1000463053224 |
oct | 147254417400 |
9 | 38717172130 |
10 | 13869653760 |
11 | 5978070176 |
12 | 2830b04000 |
13 | 1400601921 |
14 | 958066784 |
15 | 562987090 |
hex | 33ab21f00 |
13869653760 has 144 divisors (see below), whose sum is σ = 49218130080. Its totient is φ = 3698565120.
The previous prime is 13869653671. The next prime is 13869653783. The reversal of 13869653760 is 6735696831.
13869653760 is a `hidden beast` number, since 13 + 8 + 6 + 96 + 537 + 6 + 0 = 666.
It is a tau number, because it is divible by the number of its divisors (144).
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a junction number, because it is equal to n+sod(n) for n = 13869653697 and 13869653706.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 166101 + ... + 235220.
It is an arithmetic number, because the mean of its divisors is an integer number (341792570).
Almost surely, 213869653760 is an apocalyptic number.
13869653760 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13869653760 is an abundant number, since it is smaller than the sum of its proper divisors (35348476320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13869653760 is an equidigital number, since it uses as much as digits as its factorization.
13869653760 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 401351 (or 401331 counting only the distinct ones).
The product of its (nonzero) digits is 4898880, while the sum is 54.
The spelling of 13869653760 in words is "thirteen billion, eight hundred sixty-nine million, six hundred fifty-three thousand, seven hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •