Base | Representation |
---|---|
bin | 101111110001100100010010… |
… | …001011100111000111111101 |
3 | 1000112221201222210212121111221 |
4 | 233301210102023213013331 |
5 | 210020003242412340331 |
6 | 2022513120050113341 |
7 | 62154156464654512 |
oct | 5761442213470775 |
9 | 1015851883777457 |
10 | 210114400121341 |
11 | 60a490202197a1 |
12 | 1b6956b357b851 |
13 | 903191a3ba5a1 |
14 | 39c583c483309 |
15 | 1945857539711 |
hex | bf19122e71fd |
210114400121341 has 16 divisors (see below), whose sum is σ = 225522764383104. Its totient is φ = 195044806116864.
The previous prime is 210114400121333. The next prime is 210114400121447. The reversal of 210114400121341 is 143121004411012.
It is a cyclic number.
It is not a de Polignac number, because 210114400121341 - 23 = 210114400121333 is a prime.
It is a super-2 number, since 2×2101144001213412 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210114400181341) 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, 454102590 + ... + 454565056.
It is an arithmetic number, because the mean of its divisors is an integer number (14095172773944).
Almost surely, 2210114400121341 is an apocalyptic number.
It is an amenable number.
210114400121341 is a deficient number, since it is larger than the sum of its proper divisors (15408364261763).
210114400121341 is a wasteful number, since it uses less digits than its factorization.
210114400121341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 828660.
The product of its (nonzero) digits is 768, while the sum is 25.
Adding to 210114400121341 its reverse (143121004411012), we get a palindrome (353235404532353).
The spelling of 210114400121341 in words is "two hundred ten trillion, one hundred fourteen billion, four hundred million, one hundred twenty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •