Base | Representation |
---|---|
bin | 10111011100010100010010… |
… | …011111100101111101100011 |
3 | 111112001100200222022012100101 |
4 | 113130110102133211331203 |
5 | 102003201322023243243 |
6 | 1003135540131203231 |
7 | 30500541620061631 |
oct | 2734242237457543 |
9 | 445040628265311 |
10 | 103101000212323 |
11 | 2a93a985867303 |
12 | b6917b8446517 |
13 | 456b4c8768299 |
14 | 1b66187930351 |
15 | bdbd60e7254d |
hex | 5dc5127e5f63 |
103101000212323 has 4 divisors (see below), whose sum is σ = 103101021214240. Its totient is φ = 103100979210408.
The previous prime is 103101000212321. The next prime is 103101000212333. The reversal of 103101000212323 is 323212000101301.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 103101000212323 - 21 = 103101000212321 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 103101000212323.
It is not an unprimeable number, because it can be changed into a prime (103101000212321) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1234198 + ... + 14412676.
It is an arithmetic number, because the mean of its divisors is an integer number (25775255303560).
Almost surely, 2103101000212323 is an apocalyptic number.
103101000212323 is a deficient number, since it is larger than the sum of its proper divisors (21001917).
103101000212323 is an equidigital number, since it uses as much as digits as its factorization.
103101000212323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21001916.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 103101000212323 its reverse (323212000101301), we get a palindrome (426313000313624).
The spelling of 103101000212323 in words is "one hundred three trillion, one hundred one billion, two hundred twelve thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •