Base | Representation |
---|---|
bin | 1010100110001101100110… |
… | …00010101100110100011010 |
3 | 10001111202122011200022012221 |
4 | 11103012303002230310122 |
5 | 11023244424030112310 |
6 | 121321202024054254 |
7 | 4623413024524222 |
oct | 523066302546432 |
9 | 101452564608187 |
10 | 23303201410330 |
11 | 7474917756a76 |
12 | 274439700438a |
13 | 1000636c85c7a |
14 | 5a7c4952b082 |
15 | 2a6282d64ada |
hex | 1531b30acd1a |
23303201410330 has 8 divisors (see below), whose sum is σ = 41945762538612. Its totient is φ = 9321280564128.
The previous prime is 23303201410327. The next prime is 23303201410331. The reversal of 23303201410330 is 3301410230332.
It can be written as a sum of positive squares in 2 ways, for example, as 21199956044281 + 2103245366049 = 4604341^2 + 1450257^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×233032014103302 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 23303201410295 and 23303201410304.
It is not an unprimeable number, because it can be changed into a prime (23303201410331) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1165160070507 + ... + 1165160070526.
Almost surely, 223303201410330 is an apocalyptic number.
23303201410330 is a deficient number, since it is larger than the sum of its proper divisors (18642561128282).
23303201410330 is a wasteful number, since it uses less digits than its factorization.
23303201410330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2330320141040.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 23303201410330 its reverse (3301410230332), we get a palindrome (26604611640662).
The spelling of 23303201410330 in words is "twenty-three trillion, three hundred three billion, two hundred one million, four hundred ten thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •