Base | Representation |
---|---|
bin | 1001100111100011101100… |
… | …11110011010110101111111 |
3 | 2202212221220012112110200020 |
4 | 10303301312132122311333 |
5 | 10233012013100320023 |
6 | 112552210201103223 |
7 | 4312031536145241 |
oct | 463616636326577 |
9 | 82787805473606 |
10 | 21150406651263 |
11 | 681492318a1aa |
12 | 2457110487b13 |
13 | ba562315b876 |
14 | 53198406c091 |
15 | 26a285c55de3 |
hex | 133c7679ad7f |
21150406651263 has 8 divisors (see below), whose sum is σ = 29426652732288. Its totient is φ = 13487215835544.
The previous prime is 21150406651261. The next prime is 21150406651277. The reversal of 21150406651263 is 36215660405112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21150406651263 - 21 = 21150406651261 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21150406651261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 153263816245 + ... + 153263816382.
It is an arithmetic number, because the mean of its divisors is an integer number (3678331591536).
Almost surely, 221150406651263 is an apocalyptic number.
21150406651263 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
21150406651263 is a deficient number, since it is larger than the sum of its proper divisors (8276246081025).
21150406651263 is a wasteful number, since it uses less digits than its factorization.
21150406651263 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 306527632653.
The product of its (nonzero) digits is 259200, while the sum is 42.
The spelling of 21150406651263 in words is "twenty-one trillion, one hundred fifty billion, four hundred six million, six hundred fifty-one thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •