Base | Representation |
---|---|
bin | 101101100001011110001001… |
… | …000011111110010001011100 |
3 | 222020220002200110102010120102 |
4 | 231201132021003332101130 |
5 | 202220234041201220012 |
6 | 1545452114232240232 |
7 | 60112565646620213 |
oct | 5541361103762134 |
9 | 866802613363512 |
10 | 200212200023132 |
11 | 588805764344a0 |
12 | 1a556570840078 |
13 | 8793c1100754b |
14 | 376247211007a |
15 | 1822ea35e52c2 |
hex | b617890fe45c |
200212200023132 has 12 divisors (see below), whose sum is σ = 382223290953336. Its totient is φ = 91005545465040.
The previous prime is 200212200023107. The next prime is 200212200023189. The reversal of 200212200023132 is 231320002212002.
It is a happy number.
200212200023132 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2275138636583 + ... + 2275138636670.
It is an arithmetic number, because the mean of its divisors is an integer number (31851940912778).
Almost surely, 2200212200023132 is an apocalyptic number.
200212200023132 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
200212200023132 is a deficient number, since it is larger than the sum of its proper divisors (182011090930204).
200212200023132 is a wasteful number, since it uses less digits than its factorization.
200212200023132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4550277273268 (or 4550277273266 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 200212200023132 its reverse (231320002212002), we get a palindrome (431532202235134).
The spelling of 200212200023132 in words is "two hundred trillion, two hundred twelve billion, two hundred million, twenty-three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •