Base | Representation |
---|---|
bin | 101110111001111011110… |
… | …101001011101011000101 |
3 | 102102010220112021120111111 |
4 | 232321323311023223011 |
5 | 410302311032323023 |
6 | 10504433122005021 |
7 | 451606311350521 |
oct | 56717365135305 |
9 | 12363815246444 |
10 | 3223303011013 |
11 | 1032aa4577a68 |
12 | 4408457a6771 |
13 | 1a4c57921697 |
14 | b2019c20d81 |
15 | 58ca38ce00d |
hex | 2ee7bd4bac5 |
3223303011013 has 8 divisors (see below), whose sum is σ = 3253544311160. Its totient is φ = 3193073887680.
The previous prime is 3223303010899. The next prime is 3223303011017. The reversal of 3223303011013 is 3101103033223.
It can be written as a sum of positive squares in 4 ways, for example, as 1853565162849 + 1369737848164 = 1361457^2 + 1170358^2 .
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 3223303011013 - 229 = 3222766140101 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 (3223303011017) 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, 2511870 + ... + 3571567.
It is an arithmetic number, because the mean of its divisors is an integer number (406693038895).
Almost surely, 23223303011013 is an apocalyptic number.
It is an amenable number.
3223303011013 is a deficient number, since it is larger than the sum of its proper divisors (30241300147).
3223303011013 is a wasteful number, since it uses less digits than its factorization.
3223303011013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6088407.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 3223303011013 its reverse (3101103033223), we get a palindrome (6324406044236).
The spelling of 3223303011013 in words is "three trillion, two hundred twenty-three billion, three hundred three million, eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •