Base | Representation |
---|---|
bin | 1100101011110010111010… |
… | …0010010110110011100000 |
3 | 1211101021110022200122022120 |
4 | 3022330232202112303200 |
5 | 3312000003112141402 |
6 | 45354541332304240 |
7 | 2636414152234566 |
oct | 312745642266340 |
9 | 54337408618276 |
10 | 13946539568352 |
11 | 4497770001076 |
12 | 1692b23a72080 |
13 | 7a21cb2bcb41 |
14 | 36303231da36 |
15 | 192bac8653bc |
hex | caf2e896ce0 |
13946539568352 has 48 divisors (see below), whose sum is σ = 36613975022352. Its totient is φ = 4648299392000.
The previous prime is 13946539568329. The next prime is 13946539568387. The reversal of 13946539568352 is 25386593564931.
13946539568352 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (48).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7728573 + ... + 9360764.
It is an arithmetic number, because the mean of its divisors is an integer number (762791146299).
Almost surely, 213946539568352 is an apocalyptic number.
13946539568352 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13946539568352 is an abundant number, since it is smaller than the sum of its proper divisors (22667435454000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13946539568352 is a wasteful number, since it uses less digits than its factorization.
13946539568352 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17097851 (or 17097843 counting only the distinct ones).
The product of its digits is 629856000, while the sum is 69.
The spelling of 13946539568352 in words is "thirteen trillion, nine hundred forty-six billion, five hundred thirty-nine million, five hundred sixty-eight thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •