Base | Representation |
---|---|
bin | 1010011110010110110111… |
… | …11010001101111110001001 |
3 | 10000112221222120022000110202 |
4 | 11033023123322031332021 |
5 | 11004334201323104113 |
6 | 120553204232221545 |
7 | 4565046514410314 |
oct | 517133372157611 |
9 | 100487876260422 |
10 | 23033304113033 |
11 | 7380407770875 |
12 | 2700012b3a8b5 |
13 | cb105389b1a6 |
14 | 598b6432997b |
15 | 29e23831a258 |
hex | 14f2dbe8df89 |
23033304113033 has 8 divisors (see below), whose sum is σ = 23117632264896. Its totient is φ = 22949041770000.
The previous prime is 23033304112993. The next prime is 23033304113051. The reversal of 23033304113033 is 33031140333032.
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 23033304113033 - 26 = 23033304112969 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23033304112987 and 23033304113005.
It is not an unprimeable number, because it can be changed into a prime (23033304113063) 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, 15750866 + ... + 17150987.
It is an arithmetic number, because the mean of its divisors is an integer number (2889704033112).
Almost surely, 223033304113033 is an apocalyptic number.
It is an amenable number.
23033304113033 is a deficient number, since it is larger than the sum of its proper divisors (84328151863).
23033304113033 is a wasteful number, since it uses less digits than its factorization.
23033304113033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32904415.
The product of its (nonzero) digits is 17496, while the sum is 29.
Adding to 23033304113033 its reverse (33031140333032), we get a palindrome (56064444446065).
The spelling of 23033304113033 in words is "twenty-three trillion, thirty-three billion, three hundred four million, one hundred thirteen thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •