Base | Representation |
---|---|
bin | 110000010001110110100111… |
… | …100110000111101000000100 |
3 | 1000211210211212111221110122011 |
4 | 300101312213212013220010 |
5 | 210312331202130001012 |
6 | 2031332252322544004 |
7 | 62503363256526262 |
oct | 6021664746075004 |
9 | 1024724774843564 |
10 | 212333110000132 |
11 | 61723a6a09a620 |
12 | 1b9936b4b08004 |
13 | 9162c0728c104 |
14 | 3a60d97c2b432 |
15 | 19834113191a7 |
hex | c11da7987a04 |
212333110000132 has 12 divisors (see below), whose sum is σ = 405363210000336. Its totient is φ = 96515050000040.
The previous prime is 212333110000093. The next prime is 212333110000133. The reversal of 212333110000132 is 231000011333212.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is not an unprimeable number, because it can be changed into a prime (212333110000133) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2412876249958 + ... + 2412876250045.
It is an arithmetic number, because the mean of its divisors is an integer number (33780267500028).
Almost surely, 2212333110000132 is an apocalyptic number.
212333110000132 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
212333110000132 is a deficient number, since it is larger than the sum of its proper divisors (193030100000204).
212333110000132 is a wasteful number, since it uses less digits than its factorization.
212333110000132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4825752500018 (or 4825752500016 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 212333110000132 its reverse (231000011333212), we get a palindrome (443333121333344).
The spelling of 212333110000132 in words is "two hundred twelve trillion, three hundred thirty-three billion, one hundred ten million, one hundred thirty-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •