Base | Representation |
---|---|
bin | 11100000010100100110000… |
… | …001010011000111111010101 |
3 | 121011122111011102201102021221 |
4 | 130002210300022120333111 |
5 | 112131002333211001323 |
6 | 1114141234410210341 |
7 | 34655510115230251 |
oct | 3402446012307725 |
9 | 534574142642257 |
10 | 123322204000213 |
11 | 36326720178189 |
12 | 119b88047239b1 |
13 | 53a7306c6542a |
14 | 2264b7dd8d261 |
15 | e3cd60a3155d |
hex | 702930298fd5 |
123322204000213 has 8 divisors (see below), whose sum is σ = 128685842236800. Its totient is φ = 117958716037008.
The previous prime is 123322204000169. The next prime is 123322204000249. The reversal of 123322204000213 is 312000402223321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 123322204000213 - 213 = 123322203992021 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 (123322204006213) 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, 35889753 + ... + 39175486.
It is an arithmetic number, because the mean of its divisors is an integer number (16085730279600).
Almost surely, 2123322204000213 is an apocalyptic number.
It is an amenable number.
123322204000213 is a deficient number, since it is larger than the sum of its proper divisors (5363638236587).
123322204000213 is an equidigital number, since it uses as much as digits as its factorization.
123322204000213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75136691.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 123322204000213 its reverse (312000402223321), we get a palindrome (435322606223534).
The spelling of 123322204000213 in words is "one hundred twenty-three trillion, three hundred twenty-two billion, two hundred four million, two hundred thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •