Base | Representation |
---|---|
bin | 11101000111001111110… |
… | …01011111101000001100 |
3 | 10112122000020020121102210 |
4 | 32203213321133220030 |
5 | 112342130143140244 |
6 | 2043313025550420 |
7 | 132161636250114 |
oct | 16434771375014 |
9 | 3478006217383 |
10 | 1000323021324 |
11 | 3562642a3670 |
12 | 141a521a5410 |
13 | 7343a197013 |
14 | 365b72d0044 |
15 | 1b049cc14b9 |
hex | e8e7e5fa0c |
1000323021324 has 48 divisors (see below), whose sum is σ = 2546365651200. Its totient is φ = 303117608640.
The previous prime is 1000323021317. The next prime is 1000323021343. The reversal of 1000323021324 is 4231203230001.
It is a super-2 number, since 2×10003230213242 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1000323021324.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 4199577 + ... + 4431375.
It is an arithmetic number, because the mean of its divisors is an integer number (53049284400).
Almost surely, 21000323021324 is an apocalyptic number.
It is an amenable number.
1000323021324 is an abundant number, since it is smaller than the sum of its proper divisors (1546042629876).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1000323021324 is a wasteful number, since it uses less digits than its factorization.
1000323021324 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 264510 (or 264508 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 1000323021324 its reverse (4231203230001), we get a palindrome (5231526251325).
The spelling of 1000323021324 in words is "one trillion, three hundred twenty-three million, twenty-one thousand, three hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •