Base | Representation |
---|---|
bin | 10001100111110101111… |
… | …100001101000000011100 |
3 | 11021202211111202011212010 |
4 | 101213311330031000130 |
5 | 124320123033310022 |
6 | 2324155314111220 |
7 | 153331002146340 |
oct | 21476574150034 |
9 | 4252744664763 |
10 | 1211012010012 |
11 | 427650788212 |
12 | 17685157b510 |
13 | 8a275b58a6c |
14 | 42882c43620 |
15 | 2177b84d50c |
hex | 119f5f0d01c |
1211012010012 has 96 divisors (see below), whose sum is σ = 3341141637120. Its totient is φ = 334030394880.
The previous prime is 1211012010007. The next prime is 1211012010031. The reversal of 1211012010012 is 2100102101121.
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 1211012010012.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 22850008 + ... + 22902944.
It is an arithmetic number, because the mean of its divisors is an integer number (34803558720).
Almost surely, 21211012010012 is an apocalyptic number.
1211012010012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1211012010012 is an abundant number, since it is smaller than the sum of its proper divisors (2130129627108).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1211012010012 is a wasteful number, since it uses less digits than its factorization.
1211012010012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 62371 (or 62369 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1211012010012 its reverse (2100102101121), we get a palindrome (3311114111133).
The spelling of 1211012010012 in words is "one trillion, two hundred eleven billion, twelve million, ten thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •