Base | Representation |
---|---|
bin | 11101001001011100111… |
… | …001000101111010011000 |
3 | 21002111010102202210202210 |
4 | 131021130321011322120 |
5 | 230304132341331412 |
6 | 4132101020555120 |
7 | 264466351352610 |
oct | 35113471057230 |
9 | 7074112683683 |
10 | 2003013230232 |
11 | 702522828303 |
12 | 2842450b2aa0 |
13 | 116b638cb841 |
14 | 6cd36b3ba40 |
15 | 371827d683c |
hex | 1d25ce45e98 |
2003013230232 has 32 divisors (see below), whose sum is σ = 5722894944000. Its totient is φ = 572289494304.
The previous prime is 2003013230219. The next prime is 2003013230263. The reversal of 2003013230232 is 2320323103002.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 2003013230199 and 2003013230208.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5961348732 + ... + 5961349067.
It is an arithmetic number, because the mean of its divisors is an integer number (178840467000).
Almost surely, 22003013230232 is an apocalyptic number.
It is an amenable number.
2003013230232 is an abundant number, since it is smaller than the sum of its proper divisors (3719881713768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2003013230232 is a wasteful number, since it uses less digits than its factorization.
2003013230232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11922697815 (or 11922697811 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 21.
Adding to 2003013230232 its reverse (2320323103002), we get a palindrome (4323336333234).
The spelling of 2003013230232 in words is "two trillion, three billion, thirteen million, two hundred thirty thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •