Base | Representation |
---|---|
bin | 10001101000111101010… |
… | …111000001010000110100 |
3 | 11021212221000101122212210 |
4 | 101220331113001100310 |
5 | 124330101304102012 |
6 | 2324514240013420 |
7 | 153402461610210 |
oct | 21507527012064 |
9 | 4255830348783 |
10 | 1212210222132 |
11 | 428106082768 |
12 | 176b26901270 |
13 | 8a407175510 |
14 | 42958029940 |
15 | 217ebb3423c |
hex | 11a3d5c1434 |
1212210222132 has 96 divisors (see below), whose sum is σ = 3575306221312. Its totient is φ = 311063141376.
The previous prime is 1212210222131. The next prime is 1212210222137. The reversal of 1212210222132 is 2312220122121.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 1212210222099 and 1212210222108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1212210222131) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 14960713 + ... + 15041520.
Almost surely, 21212210222132 is an apocalyptic number.
1212210222132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1212210222132 is an abundant number, since it is smaller than the sum of its proper divisors (2363095999180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1212210222132 is a wasteful number, since it uses less digits than its factorization.
1212210222132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30002297 (or 30002295 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 1212210222132 its reverse (2312220122121), we get a palindrome (3524430344253).
The spelling of 1212210222132 in words is "one trillion, two hundred twelve billion, two hundred ten million, two hundred twenty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •