Base | Representation |
---|---|
bin | 10011001110011110100… |
… | …011001111110111000000 |
3 | 11200022021202010010010220 |
4 | 103032132203033313000 |
5 | 133121322020000000 |
6 | 2450542514423040 |
7 | 164311640126340 |
oct | 23163643176700 |
9 | 4608252103126 |
10 | 1321215000000 |
11 | 46a362472745 |
12 | 194088291a80 |
13 | 97789418b8c |
14 | 47d38d86d20 |
15 | 2457b6911a0 |
hex | 1339e8cfdc0 |
1321215000000 has 448 divisors, whose sum is σ = 4994262214656. Its totient is φ = 301968000000.
The previous prime is 1321214999983. The next prime is 1321215000023. The reversal of 1321215000000 is 5121231.
It is a tau number, because it is divible by the number of its divisors (448).
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 104993709 + ... + 105006291.
Almost surely, 21321215000000 is an apocalyptic number.
1321215000000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1321215000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2497131107328).
1321215000000 is an abundant number, since it is smaller than the sum of its proper divisors (3673047214656).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1321215000000 is an frugal number, since it uses more digits than its factorization.
1321215000000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12640 (or 12600 counting only the distinct ones).
The product of its (nonzero) digits is 60, while the sum is 15.
The spelling of 1321215000000 in words is "one trillion, three hundred twenty-one billion, two hundred fifteen million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •