Base | Representation |
---|---|
bin | 10001100111111011001… |
… | …011111110010000111100 |
3 | 11021210001122101001121010 |
4 | 101213323023332100330 |
5 | 124320313101430022 |
6 | 2324212140435220 |
7 | 153333121254405 |
oct | 21477313762074 |
9 | 4253048331533 |
10 | 1211100030012 |
11 | 427696436a14 |
12 | 176876b48b10 |
13 | 8a28b1666c2 |
14 | 428907d69ac |
15 | 2178443850c |
hex | 119fb2fe43c |
1211100030012 has 48 divisors (see below), whose sum is σ = 3122222084352. Its totient is φ = 363433255680.
The previous prime is 1211100029999. The next prime is 1211100030061. The reversal of 1211100030012 is 2100300011121.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a self number, because there is not a number n which added to its sum of digits gives 1211100030012.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 129055414 + ... + 129064797.
It is an arithmetic number, because the mean of its divisors is an integer number (65046293424).
Almost surely, 21211100030012 is an apocalyptic number.
1211100030012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1211100030012 is an abundant number, since it is smaller than the sum of its proper divisors (1911122054340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1211100030012 is a wasteful number, since it uses less digits than its factorization.
1211100030012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 258120258 (or 258120256 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 1211100030012 its reverse (2100300011121), we get a palindrome (3311400041133).
The spelling of 1211100030012 in words is "one trillion, two hundred eleven billion, one hundred million, thirty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •