Base | Representation |
---|---|
bin | 1001001001111001010101… |
… | …11000010100101011110011 |
3 | 2122021112020002222100012120 |
4 | 10210330222320110223303 |
5 | 10114312230131433321 |
6 | 110452054312325323 |
7 | 4145301450124434 |
oct | 444745270245363 |
9 | 78245202870176 |
10 | 20131231124211 |
11 | 6461675170a99 |
12 | 23116986a3843 |
13 | b304a025961c |
14 | 4d84dd03948b |
15 | 24d9d5d31ec6 |
hex | 124f2ae14af3 |
20131231124211 has 4 divisors (see below), whose sum is σ = 26841641498952. Its totient is φ = 13420820749472.
The previous prime is 20131231124209. The next prime is 20131231124233. The reversal of 20131231124211 is 11242113213102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20131231124211 - 21 = 20131231124209 is a prime.
It is not an unprimeable number, because it can be changed into a prime (20131231524211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3355205187366 + ... + 3355205187371.
It is an arithmetic number, because the mean of its divisors is an integer number (6710410374738).
Almost surely, 220131231124211 is an apocalyptic number.
20131231124211 is a deficient number, since it is larger than the sum of its proper divisors (6710410374741).
20131231124211 is an equidigital number, since it uses as much as digits as its factorization.
20131231124211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6710410374740.
The product of its (nonzero) digits is 576, while the sum is 24.
Adding to 20131231124211 its reverse (11242113213102), we get a palindrome (31373344337313).
The spelling of 20131231124211 in words is "twenty trillion, one hundred thirty-one billion, two hundred thirty-one million, one hundred twenty-four thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •