Base | Representation |
---|---|
bin | 1101100100000110110… |
… | …0001000101110111011 |
3 | 211021111021122221201120 |
4 | 3121001230020232323 |
5 | 12304221230320011 |
6 | 255015212320323 |
7 | 22556465031114 |
oct | 3310154105673 |
9 | 737437587646 |
10 | 233030323131 |
11 | 8a9115a6911 |
12 | 391b54730a3 |
13 | 18c89454888 |
14 | b3c8b8720b |
15 | 60dd131a06 |
hex | 3641b08bbb |
233030323131 has 16 divisors (see below), whose sum is σ = 327198234240. Its totient is φ = 147114887040.
The previous prime is 233030323121. The next prime is 233030323133. The reversal of 233030323131 is 131323030332.
233030323131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 233030323131 - 29 = 233030322619 is a prime.
It is a super-2 number, since 2×2330303231312 (a number of 24 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (233030323133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 726990 + ... + 997283.
It is an arithmetic number, because the mean of its divisors is an integer number (20449889640).
Almost surely, 2233030323131 is an apocalyptic number.
233030323131 is a deficient number, since it is larger than the sum of its proper divisors (94167911109).
233030323131 is a wasteful number, since it uses less digits than its factorization.
233030323131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1726666.
The product of its (nonzero) digits is 2916, while the sum is 24.
Adding to 233030323131 its reverse (131323030332), we get a palindrome (364353353463).
The spelling of 233030323131 in words is "two hundred thirty-three billion, thirty million, three hundred twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •