Base | Representation |
---|---|
bin | 1001100100011010100101… |
… | …00100101001100100111111 |
3 | 2202111122012010122110202000 |
4 | 10302031102210221210333 |
5 | 10224224344102403203 |
6 | 112430431533233343 |
7 | 4301160014613252 |
oct | 462152244514477 |
9 | 82448163573660 |
10 | 21042430122303 |
11 | 6783054257907 |
12 | 243a1b7332853 |
13 | b983a5c36305 |
14 | 52a65d8d3099 |
15 | 26756660a4a3 |
hex | 13235292993f |
21042430122303 has 32 divisors (see below), whose sum is σ = 32293123934400. Its totient is φ = 13532356569600.
The previous prime is 21042430122299. The next prime is 21042430122323. The reversal of 21042430122303 is 30322103424012.
21042430122303 is a `hidden beast` number, since 2 + 1 + 0 + 4 + 2 + 430 + 1 + 223 + 0 + 3 = 666.
It is not a de Polignac number, because 21042430122303 - 22 = 21042430122299 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21042430122323) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 106690908 + ... + 106887953.
It is an arithmetic number, because the mean of its divisors is an integer number (1009160122950).
Almost surely, 221042430122303 is an apocalyptic number.
21042430122303 is a deficient number, since it is larger than the sum of its proper divisors (11250693812097).
21042430122303 is a wasteful number, since it uses less digits than its factorization.
21042430122303 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 213579000 (or 213578994 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
Adding to 21042430122303 its reverse (30322103424012), we get a palindrome (51364533546315).
The spelling of 21042430122303 in words is "twenty-one trillion, forty-two billion, four hundred thirty million, one hundred twenty-two thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •