Base | Representation |
---|---|
bin | 1101100100110100101… |
… | …1111010000011110101 |
3 | 211021222201121011102211 |
4 | 3121031023322003311 |
5 | 12310120114413023 |
6 | 255050302333421 |
7 | 22564326333235 |
oct | 3311513720365 |
9 | 737881534384 |
10 | 233223201013 |
11 | 8aa00464920 |
12 | 39249b8a271 |
13 | 18cba3b71ba |
14 | b406633cc5 |
15 | 6100030a0d |
hex | 364d2fa0f5 |
233223201013 has 4 divisors (see below), whose sum is σ = 254425310208. Its totient is φ = 212021091820.
The previous prime is 233223200999. The next prime is 233223201017. The reversal of 233223201013 is 310102322332.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 233223201013 - 237 = 95784247541 is a prime.
It is a super-2 number, since 2×2332232010132 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (233223201017) 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, 10601054581 + ... + 10601054602.
It is an arithmetic number, because the mean of its divisors is an integer number (63606327552).
Almost surely, 2233223201013 is an apocalyptic number.
It is an amenable number.
233223201013 is a deficient number, since it is larger than the sum of its proper divisors (21202109195).
233223201013 is a wasteful number, since it uses less digits than its factorization.
233223201013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21202109194.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 233223201013 its reverse (310102322332), we get a palindrome (543325523345).
The spelling of 233223201013 in words is "two hundred thirty-three billion, two hundred twenty-three million, two hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •