Base | Representation |
---|---|
bin | 1001110001110101011010… |
… | …10101000001111010101111 |
3 | 2211010201022212210021222202 |
4 | 10320322231111001322233 |
5 | 10304303144122130043 |
6 | 113422324510332115 |
7 | 4346402062230623 |
oct | 470725525017257 |
9 | 84121285707882 |
10 | 21503514255023 |
11 | 6940653224219 |
12 | 24b36374ba03b |
13 | bcca077b8188 |
14 | 544ac0517183 |
15 | 274550a061b8 |
hex | 138ead541eaf |
21503514255023 has 8 divisors (see below), whose sum is σ = 22027855774848. Its totient is φ = 20980275453144.
The previous prime is 21503514255011. The next prime is 21503514255061. The reversal of 21503514255023 is 32055241530512.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21503514255023 - 24 = 21503514255007 is a prime.
It is a super-2 number, since 2×215035142550232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21503514455023) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 275640011 + ... + 275718012.
It is an arithmetic number, because the mean of its divisors is an integer number (2753481971856).
Almost surely, 221503514255023 is an apocalyptic number.
21503514255023 is a deficient number, since it is larger than the sum of its proper divisors (524341519825).
21503514255023 is an equidigital number, since it uses as much as digits as its factorization.
21503514255023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 551358973.
The product of its (nonzero) digits is 180000, while the sum is 38.
Adding to 21503514255023 its reverse (32055241530512), we get a palindrome (53558755785535).
The spelling of 21503514255023 in words is "twenty-one trillion, five hundred three billion, five hundred fourteen million, two hundred fifty-five thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •