Base | Representation |
---|---|
bin | 1001110000100100100011… |
… | …01110101000101011110011 |
3 | 2210222120021101002111011012 |
4 | 10320102101232220223303 |
5 | 10303100241443014103 |
6 | 113350345021141135 |
7 | 4343304215203322 |
oct | 470222156505363 |
9 | 83876241074135 |
10 | 21460101532403 |
11 | 69241a5940166 |
12 | 24a71406ba7ab |
13 | bc88a96a6c21 |
14 | 5429629ca0b9 |
15 | 27335e6022d8 |
hex | 138491ba8af3 |
21460101532403 has 4 divisors (see below), whose sum is σ = 22040104276560. Its totient is φ = 20880098788248.
The previous prime is 21460101532379. The next prime is 21460101532417. The reversal of 21460101532403 is 30423510106412.
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 21460101532403 - 218 = 21460101270259 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 21460101532403.
It is not an unprimeable number, because it can be changed into a prime (21460101532433) 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, 290001372023 + ... + 290001372096.
It is an arithmetic number, because the mean of its divisors is an integer number (5510026069140).
Almost surely, 221460101532403 is an apocalyptic number.
21460101532403 is a deficient number, since it is larger than the sum of its proper divisors (580002744157).
21460101532403 is an equidigital number, since it uses as much as digits as its factorization.
21460101532403 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 580002744156.
The product of its (nonzero) digits is 17280, while the sum is 32.
Adding to 21460101532403 its reverse (30423510106412), we get a palindrome (51883611638815).
The spelling of 21460101532403 in words is "twenty-one trillion, four hundred sixty billion, one hundred one million, five hundred thirty-two thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •