Base | Representation |
---|---|
bin | 11101001010100111001… |
… | …11110001000001110000 |
3 | 10112210200011222112222200 |
4 | 32211103213301001300 |
5 | 112404330330011303 |
6 | 2044212230303200 |
7 | 132254503055034 |
oct | 16452347610160 |
9 | 3483604875880 |
10 | 1002130313328 |
11 | 357001488921 |
12 | 1422774b7b00 |
13 | 7366773b181 |
14 | 367093441c4 |
15 | 1b1037ba3a3 |
hex | e9539f1070 |
1002130313328 has 60 divisors (see below), whose sum is σ = 2804673928368. Its totient is φ = 334031420160.
The previous prime is 1002130313323. The next prime is 1002130313377. The reversal of 1002130313328 is 8233130312001.
1002130313328 is a `hidden beast` number, since 1 + 0 + 0 + 21 + 3 + 0 + 313 + 328 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1002130313321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4476708 + ... + 4695228.
Almost surely, 21002130313328 is an apocalyptic number.
1002130313328 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
1002130313328 is an abundant number, since it is smaller than the sum of its proper divisors (1802543615040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1002130313328 is a wasteful number, since it uses less digits than its factorization.
1002130313328 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 250382 (or 250373 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
Adding to 1002130313328 its reverse (8233130312001), we get a palindrome (9235260625329).
The spelling of 1002130313328 in words is "one trillion, two billion, one hundred thirty million, three hundred thirteen thousand, three hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •