Base | Representation |
---|---|
bin | 11101001110001000101… |
… | …01001001111111001000 |
3 | 10112222112222010121111012 |
4 | 32213010111021333020 |
5 | 112422213420311412 |
6 | 2045124020023052 |
7 | 132352403620544 |
oct | 16470425117710 |
9 | 3488488117435 |
10 | 1004021260232 |
11 | 357891910261 |
12 | 142704831a88 |
13 | 738a9422173 |
14 | 36848532a24 |
15 | 1b1b47dac22 |
hex | e9c4549fc8 |
1004021260232 has 32 divisors (see below), whose sum is σ = 1939518614520. Its totient is φ = 486901900800.
The previous prime is 1004021260223. The next prime is 1004021260241. The reversal of 1004021260232 is 2320621204001.
It is a happy number.
1004021260232 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (1004021260223) and next prime (1004021260241).
It can be written as a sum of positive squares in 4 ways, for example, as 797438284036 + 206582976196 = 892994^2 + 454514^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1004021260198 and 1004021260207.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5256269 + ... + 5443932.
Almost surely, 21004021260232 is an apocalyptic number.
It is an amenable number.
1004021260232 is a deficient number, since it is larger than the sum of its proper divisors (935497354288).
1004021260232 is a wasteful number, since it uses less digits than its factorization.
1004021260232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10700561 (or 10700557 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 1004021260232 its reverse (2320621204001), we get a palindrome (3324642464233).
The spelling of 1004021260232 in words is "one trillion, four billion, twenty-one million, two hundred sixty thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •