Base | Representation |
---|---|
bin | 111011100110101… |
… | …1001010011101000 |
3 | 12011101100112112200 |
4 | 1313031121103220 |
5 | 13044000001412 |
6 | 530242540200 |
7 | 100363502316 |
oct | 16715312350 |
9 | 5141315480 |
10 | 2000000232 |
11 | 936a4785a |
12 | 479967660 |
13 | 25b4774b9 |
14 | 14d8990b6 |
15 | ba8b29dc |
hex | 773594e8 |
2000000232 has 24 divisors (see below), whose sum is σ = 5416667490. Its totient is φ = 666666720.
The previous prime is 2000000227. The next prime is 2000000239. The reversal of 2000000232 is 2320000002.
It can be written as a sum of positive squares in only one way, i.e., 1950635556 + 49364676 = 44166^2 + 7026^2 .
It is a tau number, because it is divible by the number of its divisors (24).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (2000000239) 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 5 ways as a sum of consecutive naturals, for example, 13888819 + ... + 13888962.
Almost surely, 22000000232 is an apocalyptic number.
It is an amenable number.
2000000232 is an abundant number, since it is smaller than the sum of its proper divisors (3416667258).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2000000232 is a wasteful number, since it uses less digits than its factorization.
2000000232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27777793 (or 27777786 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 9.
The square root of 2000000232 is about 44721.3621438346. The cubic root of 2000000232 is about 1259.9210986118.
Adding to 2000000232 its reverse (2320000002), we get a palindrome (4320000234).
The spelling of 2000000232 in words is "two billion, two hundred thirty-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •