Base | Representation |
---|---|
bin | 1100110110101001101000… |
… | …0100011110001001001111 |
3 | 1212001002210222012022012221 |
4 | 3031222122010132021033 |
5 | 3323023414440022101 |
6 | 50020342331040211 |
7 | 2656035406434502 |
oct | 315523204361117 |
9 | 55032728168187 |
10 | 14133027267151 |
11 | 45598684993a1 |
12 | 17030aa2a0067 |
13 | 7b697b069100 |
14 | 36c0839db139 |
15 | 1979748deaa1 |
hex | cda9a11e24f |
14133027267151 has 12 divisors (see below), whose sum is σ = 15717427100472. Its totient is φ = 12693280201056.
The previous prime is 14133027267143. The next prime is 14133027267187. The reversal of 14133027267151 is 15176272033141.
14133027267151 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 14133027267151 - 23 = 14133027267143 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14133027267098 and 14133027267107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14133027267251) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1130093481 + ... + 1130105986.
It is an arithmetic number, because the mean of its divisors is an integer number (1309785591706).
Almost surely, 214133027267151 is an apocalyptic number.
14133027267151 is a deficient number, since it is larger than the sum of its proper divisors (1584399833321).
14133027267151 is a wasteful number, since it uses less digits than its factorization.
14133027267151 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2260199530 (or 2260199517 counting only the distinct ones).
The product of its (nonzero) digits is 211680, while the sum is 43.
The spelling of 14133027267151 in words is "fourteen trillion, one hundred thirty-three billion, twenty-seven million, two hundred sixty-seven thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •