Base | Representation |
---|---|
bin | 100001100000111100101… |
… | …010011100111010100111 |
3 | 22011011202102001002111011 |
4 | 201200330222130322213 |
5 | 300213242234411403 |
6 | 4522012215323051 |
7 | 325252315652125 |
oct | 41407452347247 |
9 | 8134672032434 |
10 | 2303120232103 |
11 | 8088253686a9 |
12 | 31243a380487 |
13 | 13924c952c62 |
14 | 7d686174915 |
15 | 3ed9957ea6d |
hex | 2183ca9cea7 |
2303120232103 has 8 divisors (see below), whose sum is σ = 2305245897360. Its totient is φ = 2300995524480.
The previous prime is 2303120232041. The next prime is 2303120232163. The reversal of 2303120232103 is 3012320213032.
2303120232103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2303120232103 - 217 = 2303120101031 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2303120232163) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4618176 + ... + 5092522.
It is an arithmetic number, because the mean of its divisors is an integer number (288155737170).
Almost surely, 22303120232103 is an apocalyptic number.
2303120232103 is a deficient number, since it is larger than the sum of its proper divisors (2125665257).
2303120232103 is a wasteful number, since it uses less digits than its factorization.
2303120232103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 478817.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 2303120232103 its reverse (3012320213032), we get a palindrome (5315440445135).
The spelling of 2303120232103 in words is "two trillion, three hundred three billion, one hundred twenty million, two hundred thirty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •