Base | Representation |
---|---|
bin | 1101100100011100111… |
… | …0100000101101100011 |
3 | 211021201202110121201022 |
4 | 3121013032200231203 |
5 | 12304414021022243 |
6 | 255032331400055 |
7 | 22562003451320 |
oct | 3310716405543 |
9 | 737652417638 |
10 | 233123220323 |
11 | 8a959a86954 |
12 | 392205b302b |
13 | 18ca277c426 |
14 | b3d7249b47 |
15 | 60e6381b68 |
hex | 36473a0b63 |
233123220323 has 16 divisors (see below), whose sum is σ = 272955239424. Its totient is φ = 194924466240.
The previous prime is 233123220313. The next prime is 233123220359. The reversal of 233123220323 is 323022321332.
233123220323 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 233123220323 - 220 = 233122171747 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 233123220292 and 233123220301.
It is not an unprimeable number, because it can be changed into a prime (233123220313) 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, 2848886 + ... + 2929572.
It is an arithmetic number, because the mean of its divisors is an integer number (17059702464).
Almost surely, 2233123220323 is an apocalyptic number.
233123220323 is a deficient number, since it is larger than the sum of its proper divisors (39832019101).
233123220323 is a wasteful number, since it uses less digits than its factorization.
233123220323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90802.
The product of its (nonzero) digits is 7776, while the sum is 26.
Adding to 233123220323 its reverse (323022321332), we get a palindrome (556145541655).
The spelling of 233123220323 in words is "two hundred thirty-three billion, one hundred twenty-three million, two hundred twenty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •