Base | Representation |
---|---|
bin | 1001100110011111111101… |
… | …11111111001000001000001 |
3 | 2202202111000220211012001202 |
4 | 10303033332333321001001 |
5 | 10231413024324440223 |
6 | 112523353541310545 |
7 | 4306303440246152 |
oct | 463177677710101 |
9 | 82674026735052 |
10 | 21114042421313 |
11 | 6800462560aa6 |
12 | 2450062105455 |
13 | ba207940183a |
14 | 52dcd46c1929 |
15 | 269358549428 |
hex | 1333feff9041 |
21114042421313 has 4 divisors (see below), whose sum is σ = 21795140563968. Its totient is φ = 20432944278660.
The previous prime is 21114042421291. The next prime is 21114042421379. The reversal of 21114042421313 is 31312424041112.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 21114042421313 - 26 = 21114042421249 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21114042441313) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 340549071281 + ... + 340549071342.
It is an arithmetic number, because the mean of its divisors is an integer number (5448785140992).
Almost surely, 221114042421313 is an apocalyptic number.
It is an amenable number.
21114042421313 is a deficient number, since it is larger than the sum of its proper divisors (681098142655).
21114042421313 is an equidigital number, since it uses as much as digits as its factorization.
21114042421313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 681098142654.
The product of its (nonzero) digits is 4608, while the sum is 29.
Adding to 21114042421313 its reverse (31312424041112), we get a palindrome (52426466462425).
The spelling of 21114042421313 in words is "twenty-one trillion, one hundred fourteen billion, forty-two million, four hundred twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •