Base | Representation |
---|---|
bin | 11101001001000100011… |
… | …01000100111010101000 |
3 | 10112201112101220221000201 |
4 | 32210202031010322220 |
5 | 112401131103431240 |
6 | 2043554052241544 |
7 | 132225115024123 |
oct | 16444215047250 |
9 | 3481471827021 |
10 | 1001301233320 |
11 | 356716495833 |
12 | 1420859102b4 |
13 | 73564a45c9b |
14 | 3666b1a93ba |
15 | 1b0a5aebd9a |
hex | e922344ea8 |
1001301233320 has 32 divisors (see below), whose sum is σ = 2300862412800. Its totient is φ = 391998779968.
The previous prime is 1001301233281. The next prime is 1001301233321. The reversal of 1001301233320 is 233321031001.
It is not an unprimeable number, because it can be changed into a prime (1001301233321) 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, 266301640 + ... + 266305399.
It is an arithmetic number, because the mean of its divisors is an integer number (71901950400).
Almost surely, 21001301233320 is an apocalyptic number.
1001301233320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1001301233320 is an abundant number, since it is smaller than the sum of its proper divisors (1299561179480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1001301233320 is a wasteful number, since it uses less digits than its factorization.
1001301233320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 532607097 (or 532607093 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 1001301233320 its reverse (233321031001), we get a palindrome (1234622264321).
The spelling of 1001301233320 in words is "one trillion, one billion, three hundred one million, two hundred thirty-three thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •