Base | Representation |
---|---|
bin | 101101100000001011010010… |
… | …000011000010010011001000 |
3 | 222020120121000222222212212010 |
4 | 231200023102003002103020 |
5 | 202212304333412413112 |
6 | 1545343202012215520 |
7 | 60103266126613605 |
oct | 5540132203022310 |
9 | 866517028885763 |
10 | 200123230201032 |
11 | 588468702792a6 |
12 | 1a541280a6a5a0 |
13 | 878870275a3b8 |
14 | 375c031d776ac |
15 | 18209e790b63c |
hex | b602d20c24c8 |
200123230201032 has 32 divisors (see below), whose sum is σ = 526640079477600. Its totient is φ = 63196809537024.
The previous prime is 200123230201009. The next prime is 200123230201033. The reversal of 200123230201032 is 230102032321002.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (200123230201033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 219433365993 + ... + 219433366904.
It is an arithmetic number, because the mean of its divisors is an integer number (16457502483675).
Almost surely, 2200123230201032 is an apocalyptic number.
It is an amenable number.
200123230201032 is an abundant number, since it is smaller than the sum of its proper divisors (326516849276568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200123230201032 is a wasteful number, since it uses less digits than its factorization.
200123230201032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 438866732925 (or 438866732921 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 200123230201032 its reverse (230102032321002), we get a palindrome (430225262522034).
The spelling of 200123230201032 in words is "two hundred trillion, one hundred twenty-three billion, two hundred thirty million, two hundred one thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •