Base | Representation |
---|---|
bin | 1010100111000000010000… |
… | …11000111111100010110101 |
3 | 10001121100211220111101201211 |
4 | 11103200020120333202311 |
5 | 11024221131144340313 |
6 | 121341501135121421 |
7 | 4625365065332140 |
oct | 523401030774265 |
9 | 101540756441654 |
10 | 23330403121333 |
11 | 7485406381070 |
12 | 2749708973271 |
13 | 100308069c859 |
14 | 5a92aa079057 |
15 | 2a6d25e90e3d |
hex | 15380863f8b5 |
23330403121333 has 16 divisors (see below), whose sum is σ = 29092008470400. Its totient is φ = 18176564505600.
The previous prime is 23330403121327. The next prime is 23330403121367. The reversal of 23330403121333 is 33312130403332.
It is a cyclic number.
It is not a de Polignac number, because 23330403121333 - 221 = 23330401024181 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23330403121295 and 23330403121304.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23330403124333) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 24278908 + ... + 25221541.
It is an arithmetic number, because the mean of its divisors is an integer number (1818250529400).
Almost surely, 223330403121333 is an apocalyptic number.
It is an amenable number.
23330403121333 is a deficient number, since it is larger than the sum of its proper divisors (5761605349067).
23330403121333 is a wasteful number, since it uses less digits than its factorization.
23330403121333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49506588.
The product of its (nonzero) digits is 34992, while the sum is 31.
Adding to 23330403121333 its reverse (33312130403332), we get a palindrome (56642533524665).
The spelling of 23330403121333 in words is "twenty-three trillion, three hundred thirty billion, four hundred three million, one hundred twenty-one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •