Base | Representation |
---|---|
bin | 1100111101010111010100… |
… | …0100111100110010000001 |
3 | 1212110010112110022110200000 |
4 | 3033111311010330302001 |
5 | 3331421130403041031 |
6 | 50145340002150213 |
7 | 3000260624045034 |
oct | 317256504746201 |
9 | 55403473273600 |
10 | 14248370752641 |
11 | 45a3777921213 |
12 | 172151a652369 |
13 | 7c480060983c |
14 | 3738a673501b |
15 | 19a975b8c3e6 |
hex | cf57513cc81 |
14248370752641 has 24 divisors (see below), whose sum is σ = 22466566842720. Its totient is φ = 8998970998752.
The previous prime is 14248370752621. The next prime is 14248370752643. The reversal of 14248370752641 is 14625707384241.
14248370752641 is a `hidden beast` number, since 1 + 4 + 2 + 4 + 8 + 3 + 70 + 7 + 526 + 41 = 666.
14248370752641 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 14248370752641 - 222 = 14248366558337 is a prime.
It is not an unprimeable number, because it can be changed into a prime (14248370752643) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1543028820 + ... + 1543038053.
It is an arithmetic number, because the mean of its divisors is an integer number (936106951780).
Almost surely, 214248370752641 is an apocalyptic number.
It is an amenable number.
14248370752641 is a deficient number, since it is larger than the sum of its proper divisors (8218196090079).
14248370752641 is an equidigital number, since it uses as much as digits as its factorization.
14248370752641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3086066907 (or 3086066895 counting only the distinct ones).
The product of its (nonzero) digits is 9031680, while the sum is 54.
The spelling of 14248370752641 in words is "fourteen trillion, two hundred forty-eight billion, three hundred seventy million, seven hundred fifty-two thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •