Base | Representation |
---|---|
bin | 1001101010100111001000… |
… | …00010111000110111001011 |
3 | 2210020222201002022021111102 |
4 | 10311103210002320313023 |
5 | 10241221400440034201 |
6 | 113112321111052015 |
7 | 4322434514130425 |
oct | 465234402706713 |
9 | 83228632267442 |
10 | 21255324143051 |
11 | 68553723986a9 |
12 | 247351107100b |
13 | bb24a369bc5b |
14 | 536a98233815 |
15 | 26cd76a4a26b |
hex | 1354e40b8dcb |
21255324143051 has 4 divisors (see below), whose sum is σ = 21256908364872. Its totient is φ = 21253739921232.
The previous prime is 21255324143023. The next prime is 21255324143059. The reversal of 21255324143051 is 15034142355212.
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 21255324143051 - 230 = 21254250401227 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21255324142996 and 21255324143014.
It is not an unprimeable number, because it can be changed into a prime (21255324143059) 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, 792090785 + ... + 792117618.
It is an arithmetic number, because the mean of its divisors is an integer number (5314227091218).
Almost surely, 221255324143051 is an apocalyptic number.
21255324143051 is a deficient number, since it is larger than the sum of its proper divisors (1584221821).
21255324143051 is a wasteful number, since it uses less digits than its factorization.
21255324143051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1584221820.
The product of its (nonzero) digits is 144000, while the sum is 38.
Adding to 21255324143051 its reverse (15034142355212), we get a palindrome (36289466498263).
The spelling of 21255324143051 in words is "twenty-one trillion, two hundred fifty-five billion, three hundred twenty-four million, one hundred forty-three thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •