Base | Representation |
---|---|
bin | 11110100110111000010… |
… | …100001111110110100110 |
3 | 21110002001202221221200022 |
4 | 132212320110033312212 |
5 | 233430110304321202 |
6 | 4250131305515142 |
7 | 304650340155266 |
oct | 36467024176646 |
9 | 7402052857608 |
10 | 2103331323302 |
11 | 741021775440 |
12 | 29b7814a2ab2 |
13 | 1234602a2521 |
14 | 73b321217a6 |
15 | 39aa4905ea2 |
hex | 1e9b850fda6 |
2103331323302 has 8 divisors (see below), whose sum is σ = 3441814892712. Its totient is φ = 956059692400.
The previous prime is 2103331323293. The next prime is 2103331323311. The reversal of 2103331323302 is 2033231333012.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (2103331323293) and next prime (2103331323311).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 47802984599 + ... + 47802984642.
It is an arithmetic number, because the mean of its divisors is an integer number (430226861589).
Almost surely, 22103331323302 is an apocalyptic number.
2103331323302 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
2103331323302 is a deficient number, since it is larger than the sum of its proper divisors (1338483569410).
2103331323302 is a wasteful number, since it uses less digits than its factorization.
2103331323302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95605969254.
The product of its (nonzero) digits is 5832, while the sum is 26.
Adding to 2103331323302 its reverse (2033231333012), we get a palindrome (4136562656314).
The spelling of 2103331323302 in words is "two trillion, one hundred three billion, three hundred thirty-one million, three hundred twenty-three thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •