Base | Representation |
---|---|
bin | 101110111001110001100… |
… | …010011001001000000111 |
3 | 102102010110111022121200001 |
4 | 232321301202121020013 |
5 | 410301432330010343 |
6 | 10504404032302131 |
7 | 451602113424442 |
oct | 56716142311007 |
9 | 12363414277601 |
10 | 3223130313223 |
11 | 1032a16042617 |
12 | 4407b79a1947 |
13 | 1a4c2ac06442 |
14 | b2000d08659 |
15 | 58c9366944d |
hex | 2ee71899207 |
3223130313223 has 8 divisors (see below), whose sum is σ = 3256411935168. Its totient is φ = 3189849782784.
The previous prime is 3223130313217. The next prime is 3223130313251.
3223130313223 is nontrivially palindromic in base 10.
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 3223130313223 - 25 = 3223130313191 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3223130313191 and 3223130313200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3223130317223) 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, 6535890 + ... + 7011712.
It is an arithmetic number, because the mean of its divisors is an integer number (407051491896).
Almost surely, 23223130313223 is an apocalyptic number.
3223130313223 is a deficient number, since it is larger than the sum of its proper divisors (33281621945).
3223130313223 is an equidigital number, since it uses as much as digits as its factorization.
3223130313223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 545753.
The product of its (nonzero) digits is 11664, while the sum is 28.
It can be divided in two parts, 3223130 and 313223, that added together give a palindrome (3536353).
The spelling of 3223130313223 in words is "three trillion, two hundred twenty-three billion, one hundred thirty million, three hundred thirteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •