Base | Representation |
---|---|
bin | 101110100100011100110… |
… | …000100111011011110000 |
3 | 102022221100202020210122102 |
4 | 232210130300213123300 |
5 | 404413034141021000 |
6 | 10450100010355532 |
7 | 450131521611266 |
oct | 56443460473360 |
9 | 12287322223572 |
10 | 3200233142000 |
11 | 10242361a6a14 |
12 | 43828772bba8 |
13 | 1a2a1c23b50b |
14 | b0c6bd46436 |
15 | 583a33bc3d5 |
hex | 2e91cc276f0 |
3200233142000 has 80 divisors (see below), whose sum is σ = 7794647351712. Its totient is φ = 1270749401600.
The previous prime is 3200233141979. The next prime is 3200233142003. The reversal of 3200233142000 is 2413320023.
3200233142000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3200233142003) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5565842 + ... + 6113841.
Almost surely, 23200233142000 is an apocalyptic number.
It is an amenable number.
3200233142000 is an abundant number, since it is smaller than the sum of its proper divisors (4594414209712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3200233142000 is a wasteful number, since it uses less digits than its factorization.
3200233142000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11679843 (or 11679827 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 20.
Adding to 3200233142000 its reverse (2413320023), we get a palindrome (3202646462023).
The spelling of 3200233142000 in words is "three trillion, two hundred billion, two hundred thirty-three million, one hundred forty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •