Base | Representation |
---|---|
bin | 1001101001011001010011… |
… | …10100100000001010000111 |
3 | 2210002222212102200012012222 |
4 | 10310230221310200022013 |
5 | 10240030320021312012 |
6 | 113041211301202555 |
7 | 4316425265143034 |
oct | 464545164401207 |
9 | 83088772605188 |
10 | 21213545104007 |
11 | 68396831a2263 |
12 | 24673b140045b |
13 | bab575b88289 |
14 | 534a5368838b |
15 | 26bc2dc9a972 |
hex | 134b29d20287 |
21213545104007 has 4 divisors (see below), whose sum is σ = 21254262081696. Its totient is φ = 21172828126320.
The previous prime is 21213545103991. The next prime is 21213545104061. The reversal of 21213545104007 is 70040154531212.
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 21213545104007 - 24 = 21213545103991 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21213545104097) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20358488063 + ... + 20358489104.
It is an arithmetic number, because the mean of its divisors is an integer number (5313565520424).
Almost surely, 221213545104007 is an apocalyptic number.
21213545104007 is a deficient number, since it is larger than the sum of its proper divisors (40716977689).
21213545104007 is an equidigital number, since it uses as much as digits as its factorization.
21213545104007 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40716977688.
The product of its (nonzero) digits is 33600, while the sum is 35.
Adding to 21213545104007 its reverse (70040154531212), we get a palindrome (91253699635219).
The spelling of 21213545104007 in words is "twenty-one trillion, two hundred thirteen billion, five hundred forty-five million, one hundred four thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •