Base | Representation |
---|---|
bin | 10010111100100110100… |
… | …000011100011100010000 |
3 | 11121110202002110111100211 |
4 | 102330212200130130100 |
5 | 132313014402130000 |
6 | 2434050143253504 |
7 | 163032203666563 |
oct | 22744640343420 |
9 | 4543662414324 |
10 | 1302021130000 |
11 | 462202a91068 |
12 | 1904102aa294 |
13 | 95a1aa5c356 |
14 | 47037b844da |
15 | 23d065ad7ba |
hex | 12f2681c710 |
1302021130000 has 50 divisors (see below), whose sum is σ = 3152323382054. Its totient is φ = 520808448000.
The previous prime is 1302021129977. The next prime is 1302021130013. The reversal of 1302021130000 is 311202031.
It can be written as a sum of positive squares in 5 ways, for example, as 356366017296 + 945655112704 = 596964^2 + 972448^2 .
It is a tau number, because it is divible by the number of its divisors (50).
It is an unprimeable number.
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 9 ways as a sum of consecutive naturals, for example, 65091057 + ... + 65111056.
Almost surely, 21302021130000 is an apocalyptic number.
1302021130000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1302021130000 is an abundant number, since it is smaller than the sum of its proper divisors (1850302252054).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1302021130000 is an equidigital number, since it uses as much as digits as its factorization.
1302021130000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130202141 (or 130202120 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 1302021130000 its reverse (311202031), we get a palindrome (1302332332031).
The spelling of 1302021130000 in words is "one trillion, three hundred two billion, twenty-one million, one hundred thirty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •