Base | Representation |
---|---|
bin | 11101001110001001111… |
… | …10001101001011100111 |
3 | 10112222120201101022210102 |
4 | 32213010332031023213 |
5 | 112422224144134343 |
6 | 2045125042414315 |
7 | 132352564236650 |
oct | 16470476151347 |
9 | 3488521338712 |
10 | 1004032021223 |
11 | 3578979a0140 |
12 | 14270836139b |
13 | 738ab71c20a |
14 | 36849b34527 |
15 | 1b1b57143b8 |
hex | e9c4f8d2e7 |
1004032021223 has 64 divisors (see below), whose sum is σ = 1277337600000. Its totient is φ = 766599292800.
The previous prime is 1004032021219. The next prime is 1004032021247. The reversal of 1004032021223 is 3221202304001.
It is not a de Polignac number, because 1004032021223 - 22 = 1004032021219 is a prime.
It is a super-2 number, since 2×10040320212232 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1004032021195 and 1004032021204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1004032021283) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 286946528 + ... + 286950026.
It is an arithmetic number, because the mean of its divisors is an integer number (19958400000).
Almost surely, 21004032021223 is an apocalyptic number.
1004032021223 is a deficient number, since it is larger than the sum of its proper divisors (273305578777).
1004032021223 is a wasteful number, since it uses less digits than its factorization.
1004032021223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3996.
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 1004032021223 its reverse (3221202304001), we get a palindrome (4225234325224).
The spelling of 1004032021223 in words is "one trillion, four billion, thirty-two million, twenty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •