Base | Representation |
---|---|
bin | 10001101000000001111… |
… | …100000100000100100000 |
3 | 11021210100112111202210212 |
4 | 101220001330010010200 |
5 | 124321031101100000 |
6 | 2324231304313252 |
7 | 153335665115534 |
oct | 21500174040440 |
9 | 4253315452725 |
10 | 1211213300000 |
11 | 427744371380 |
12 | 1768a8a72828 |
13 | 8a2a8775272 |
14 | 428a187dbc4 |
15 | 2178e35ec35 |
hex | 11a01f04120 |
1211213300000 has 144 divisors (see below), whose sum is σ = 3251489641344. Its totient is φ = 440440800000.
The previous prime is 1211213299993. The next prime is 1211213300057. The reversal of 1211213300000 is 33121121.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 549449 + ... + 1650551.
It is an arithmetic number, because the mean of its divisors is an integer number (22579789176).
Almost surely, 21211213300000 is an apocalyptic number.
1211213300000 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 1211213300000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1625744820672).
1211213300000 is an abundant number, since it is smaller than the sum of its proper divisors (2040276341344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1211213300000 is an equidigital number, since it uses as much as digits as its factorization.
1211213300000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1101149 (or 1101121 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 1211213300000 its reverse (33121121), we get a palindrome (1211246421121).
The spelling of 1211213300000 in words is "one trillion, two hundred eleven billion, two hundred thirteen million, three hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •