Base | Representation |
---|---|
bin | 1101001101111101000000… |
… | …0111101000101110100001 |
3 | 1220110101011021012100210020 |
4 | 3103133100013220232201 |
5 | 3401103313200300441 |
6 | 50524311452024053 |
7 | 3030000233641206 |
oct | 323372007505641 |
9 | 56411137170706 |
10 | 14533366025121 |
11 | 46a3625267659 |
12 | 17687b6a62029 |
13 | 81564b925648 |
14 | 3835c0b81cad |
15 | 1a30a5e00e66 |
hex | d37d01e8ba1 |
14533366025121 has 16 divisors (see below), whose sum is σ = 19548156902400. Its totient is φ = 9604066134608.
The previous prime is 14533366025069. The next prime is 14533366025147. The reversal of 14533366025121 is 12152066333541.
It is a happy number.
14533366025121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 14533366025121 - 210 = 14533366024097 is a prime.
It is a super-2 number, since 2×145333660251212 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (14533366025021) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 40222251 + ... + 40581968.
It is an arithmetic number, because the mean of its divisors is an integer number (1221759806400).
Almost surely, 214533366025121 is an apocalyptic number.
It is an amenable number.
14533366025121 is a deficient number, since it is larger than the sum of its proper divisors (5014790877279).
14533366025121 is a wasteful number, since it uses less digits than its factorization.
14533366025121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 80804748.
The product of its (nonzero) digits is 388800, while the sum is 42.
The spelling of 14533366025121 in words is "fourteen trillion, five hundred thirty-three billion, three hundred sixty-six million, twenty-five thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •