Base | Representation |
---|---|
bin | 1101100000010001011… |
… | …0110001010111001010 |
3 | 211011211120101210002200 |
4 | 3120010112301113022 |
5 | 12300114313442302 |
6 | 254325133141030 |
7 | 22522131421212 |
oct | 3300426612712 |
9 | 734746353080 |
10 | 232001312202 |
11 | 8a433768760 |
12 | 38b6892a776 |
13 | 18b541ca97a |
14 | b32c247242 |
15 | 607cb1e81c |
hex | 36045b15ca |
232001312202 has 48 divisors (see below), whose sum is σ = 572208781248. Its totient is φ = 67246755840.
The previous prime is 232001312171. The next prime is 232001312203. The reversal of 232001312202 is 202213100232.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (232001312203) 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 23 ways as a sum of consecutive naturals, for example, 25467703 + ... + 25476810.
It is an arithmetic number, because the mean of its divisors is an integer number (11921016276).
Almost surely, 2232001312202 is an apocalyptic number.
232001312202 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
232001312202 is an abundant number, since it is smaller than the sum of its proper divisors (340207469046).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
232001312202 is a wasteful number, since it uses less digits than its factorization.
232001312202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50944555 (or 50944552 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 232001312202 its reverse (202213100232), we get a palindrome (434214412434).
The spelling of 232001312202 in words is "two hundred thirty-two billion, one million, three hundred twelve thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •