Base | Representation |
---|---|
bin | 1001101100001101001110… |
… | …11100011101111111011001 |
3 | 2210110020012102210121202212 |
4 | 10312012213130131333121 |
5 | 10243121132323412101 |
6 | 113153424420204505 |
7 | 4326415120262423 |
oct | 466064734357731 |
9 | 83406172717685 |
10 | 21310142013401 |
11 | 6876642680a8a |
12 | 248206b539735 |
13 | bb76cb62c227 |
14 | 5395b8775813 |
15 | 26e4d436c1bb |
hex | 1361a771dfd9 |
21310142013401 has 4 divisors (see below), whose sum is σ = 21310204925412. Its totient is φ = 21310079101392.
The previous prime is 21310142013371. The next prime is 21310142013403. The reversal of 21310142013401 is 10431024101312.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 10637375727001 + 10672766286400 = 3261499^2 + 3266920^2 .
It is a cyclic number.
It is not a de Polignac number, because 21310142013401 - 26 = 21310142013337 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21310142013403) 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, 30945146 + ... + 31626291.
It is an arithmetic number, because the mean of its divisors is an integer number (5327551231353).
Almost surely, 221310142013401 is an apocalyptic number.
It is an amenable number.
21310142013401 is a deficient number, since it is larger than the sum of its proper divisors (62912011).
21310142013401 is an equidigital number, since it uses as much as digits as its factorization.
21310142013401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62912010.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 21310142013401 its reverse (10431024101312), we get a palindrome (31741166114713).
The spelling of 21310142013401 in words is "twenty-one trillion, three hundred ten billion, one hundred forty-two million, thirteen thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •