Base | Representation |
---|---|
bin | 1010011110010110110111… |
… | …11010001011011000100001 |
3 | 10000112221222120021110221011 |
4 | 11033023123322023120201 |
5 | 11004334201322234213 |
6 | 120553204232100521 |
7 | 4565046514334362 |
oct | 517133372133041 |
9 | 100487876243834 |
10 | 23033304102433 |
11 | 7380407763909 |
12 | 2700012b34741 |
13 | cb1053896411 |
14 | 598b64325b69 |
15 | 29e23831703d |
hex | 14f2dbe8b621 |
23033304102433 has 8 divisors (see below), whose sum is σ = 23425075627200. Its totient is φ = 22641578462448.
The previous prime is 23033304102409. The next prime is 23033304102493. The reversal of 23033304102433 is 33420140333032.
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 23033304102433 - 25 = 23033304102401 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23033304102395 and 23033304102404.
It is not an unprimeable number, because it can be changed into a prime (23033304102493) 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, 10457941 + ... + 12467362.
It is an arithmetic number, because the mean of its divisors is an integer number (2928134453400).
Almost surely, 223033304102433 is an apocalyptic number.
It is an amenable number.
23033304102433 is a deficient number, since it is larger than the sum of its proper divisors (391771524767).
23033304102433 is a wasteful number, since it uses less digits than its factorization.
23033304102433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22942391.
The product of its (nonzero) digits is 46656, while the sum is 31.
Adding to 23033304102433 its reverse (33420140333032), we get a palindrome (56453444435465).
The spelling of 23033304102433 in words is "twenty-three trillion, thirty-three billion, three hundred four million, one hundred two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •