Base | Representation |
---|---|
bin | 1010100110110001001101… |
… | …10001110111010111100011 |
3 | 10001120120222210100220000212 |
4 | 11103120212301313113203 |
5 | 11024103104143221311 |
6 | 121334043254404335 |
7 | 4624660622540123 |
oct | 523304661672743 |
9 | 101516883326025 |
10 | 23322323023331 |
11 | 7481a3a375922 |
12 | 27480329606ab |
13 | 1002393693887 |
14 | 5a8b40cc0c83 |
15 | 2a6a01922c8b |
hex | 153626c775e3 |
23322323023331 has 8 divisors (see below), whose sum is σ = 23340874531920. Its totient is φ = 23303778164352.
The previous prime is 23322323023313. The next prime is 23322323023333. The reversal of 23322323023331 is 13332032322332.
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 23322323023331 - 210 = 23322323022307 is a prime.
It is a super-2 number, since 2×233223230233312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23322323023333) 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, 5366840 + ... + 8686058.
It is an arithmetic number, because the mean of its divisors is an integer number (2917609316490).
Almost surely, 223322323023331 is an apocalyptic number.
23322323023331 is a deficient number, since it is larger than the sum of its proper divisors (18551508589).
23322323023331 is a wasteful number, since it uses less digits than its factorization.
23322323023331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3324805.
The product of its (nonzero) digits is 69984, while the sum is 32.
Adding to 23322323023331 its reverse (13332032322332), we get a palindrome (36654355345663).
The spelling of 23322323023331 in words is "twenty-three trillion, three hundred twenty-two billion, three hundred twenty-three million, twenty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •