Base | Representation |
---|---|
bin | 10011001101010111111… |
… | …111110011111000100100 |
3 | 11200012020020210012012200 |
4 | 103031113333303320210 |
5 | 133111411003232002 |
6 | 2450225232014500 |
7 | 164240414651262 |
oct | 23152777637044 |
9 | 4605206705180 |
10 | 1320031305252 |
11 | 469905293320 |
12 | 1939b7991430 |
13 | 9762b11319a |
14 | 47c65a9d432 |
15 | 2450c7c6b1c |
hex | 13357ff3e24 |
1320031305252 has 36 divisors (see below), whose sum is σ = 3640086327696. Its totient is φ = 400009486320.
The previous prime is 1320031305251. The next prime is 1320031305301. The reversal of 1320031305252 is 2525031300231.
It is a happy number.
1320031305252 is a `hidden beast` number, since 1 + 3 + 2 + 0 + 0 + 3 + 130 + 525 + 2 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is not an unprimeable number, because it can be changed into a prime (1320031305251) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1666705798 + ... + 1666706589.
Almost surely, 21320031305252 is an apocalyptic number.
1320031305252 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1320031305252 is an abundant number, since it is smaller than the sum of its proper divisors (2320055022444).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1320031305252 is a wasteful number, since it uses less digits than its factorization.
1320031305252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3333412408 (or 3333412403 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 27.
Adding to 1320031305252 its reverse (2525031300231), we get a palindrome (3845062605483).
The spelling of 1320031305252 in words is "one trillion, three hundred twenty billion, thirty-one million, three hundred five thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •