Base | Representation |
---|---|
bin | 101110100111000001111… |
… | …000101111010011000010 |
3 | 102100012111211012011211210 |
4 | 232213001320233103002 |
5 | 404434222344341002 |
6 | 10451234533150550 |
7 | 450260261431620 |
oct | 56470170572302 |
9 | 12305454164753 |
10 | 3203003512002 |
11 | 1025427a869a8 |
12 | 43891b48b456 |
13 | 1a3071192cc8 |
14 | b1051c56510 |
15 | 584b670296c |
hex | 2e9c1e2f4c2 |
3203003512002 has 32 divisors (see below), whose sum is σ = 7325569360512. Its totient is φ = 914591551104.
The previous prime is 3203003512001. The next prime is 3203003512087. The reversal of 3203003512002 is 2002153003023.
3203003512002 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 3203003512002.
It is not an unprimeable number, because it can be changed into a prime (3203003512001) 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, 22942473 + ... + 23081660.
It is an arithmetic number, because the mean of its divisors is an integer number (228924042516).
Almost surely, 23203003512002 is an apocalyptic number.
3203003512002 is an abundant number, since it is smaller than the sum of its proper divisors (4122565848510).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3203003512002 is a wasteful number, since it uses less digits than its factorization.
3203003512002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46025802.
The product of its (nonzero) digits is 1080, while the sum is 21.
Adding to 3203003512002 its reverse (2002153003023), we get a palindrome (5205156515025).
The spelling of 3203003512002 in words is "three trillion, two hundred three billion, three million, five hundred twelve thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •