Base | Representation |
---|---|
bin | 1101100100000100010… |
… | …1001110010011001001 |
3 | 211021110120110200211111 |
4 | 3121001011032103021 |
5 | 12304211122403223 |
6 | 255014205530321 |
7 | 22556312234116 |
oct | 3310105162311 |
9 | 737416420744 |
10 | 233020122313 |
11 | 8a906869890 |
12 | 391b1b739a1 |
13 | 18c872c27a4 |
14 | b3c768d90d |
15 | 60dc2b930d |
hex | 364114e4c9 |
233020122313 has 4 divisors (see below), whose sum is σ = 254203769808. Its totient is φ = 211836474820.
The previous prime is 233020122277. The next prime is 233020122319. The reversal of 233020122313 is 313221020332.
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 a de Polignac number, because none of the positive numbers 2k-233020122313 is a prime.
It is a super-4 number, since 4×2330201223134 (a number of 47 digits) contains 4444 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (233020122319) 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, 10591823731 + ... + 10591823752.
It is an arithmetic number, because the mean of its divisors is an integer number (63550942452).
Almost surely, 2233020122313 is an apocalyptic number.
It is an amenable number.
233020122313 is a deficient number, since it is larger than the sum of its proper divisors (21183647495).
233020122313 is a wasteful number, since it uses less digits than its factorization.
233020122313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21183647494.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 233020122313 its reverse (313221020332), we get a palindrome (546241142645).
The spelling of 233020122313 in words is "two hundred thirty-three billion, twenty million, one hundred twenty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •