Base | Representation |
---|---|
bin | 101010010110110… |
… | …0100110101110011 |
3 | 10200001022010212122 |
4 | 1110231210311303 |
5 | 10402313433043 |
6 | 353005544455 |
7 | 50135166653 |
oct | 12455446563 |
9 | 3601263778 |
10 | 1421233523 |
11 | 66a281866 |
12 | 337b7512b |
13 | 1985a44a8 |
14 | d6a7c363 |
15 | 84b8b368 |
hex | 54b64d73 |
1421233523 has 8 divisors (see below), whose sum is σ = 1430880000. Its totient is φ = 1411612488.
The previous prime is 1421233487. The next prime is 1421233543. The reversal of 1421233523 is 3253321241.
It is a happy number.
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 1421233523 - 28 = 1421233267 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1421233492 and 1421233501.
It is not an unprimeable number, because it can be changed into a prime (1421233543) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 113240 + ... + 125162.
It is an arithmetic number, because the mean of its divisors is an integer number (178860000).
Almost surely, 21421233523 is an apocalyptic number.
1421233523 is a deficient number, since it is larger than the sum of its proper divisors (9646477).
1421233523 is a wasteful number, since it uses less digits than its factorization.
1421233523 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12721.
The product of its digits is 4320, while the sum is 26.
The square root of 1421233523 is about 37699.2509607286. The cubic root of 1421233523 is about 1124.3162325278.
Adding to 1421233523 its reverse (3253321241), we get a palindrome (4674554764).
The spelling of 1421233523 in words is "one billion, four hundred twenty-one million, two hundred thirty-three thousand, five hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •