Base | Representation |
---|---|
bin | 1001011001010011011110… |
… | …1010011101001011011011 |
3 | 1100120120101110211021012001 |
4 | 2112110313222131023123 |
5 | 2323223004014121243 |
6 | 33545404352101431 |
7 | 2114225133044005 |
oct | 226246752351333 |
9 | 40516343737161 |
10 | 10330330223323 |
11 | 3323083110a90 |
12 | 11aa106834877 |
13 | 59c1b889c826 |
14 | 279dc24b9375 |
15 | 12dab0209a4d |
hex | 96537a9d2db |
10330330223323 has 8 divisors (see below), whose sum is σ = 11269620555696. Its totient is φ = 9391068124800.
The previous prime is 10330330223287. The next prime is 10330330223363. The reversal of 10330330223323 is 32332203303301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10330330223323 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10330330223291 and 10330330223300.
It is not an unprimeable number, because it can be changed into a prime (10330330223363) 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, 6289786 + ... + 7760287.
It is an arithmetic number, because the mean of its divisors is an integer number (1408702569462).
Almost surely, 210330330223323 is an apocalyptic number.
10330330223323 is a deficient number, since it is larger than the sum of its proper divisors (939290332373).
10330330223323 is a wasteful number, since it uses less digits than its factorization.
10330330223323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14116925.
The product of its (nonzero) digits is 17496, while the sum is 28.
Adding to 10330330223323 its reverse (32332203303301), we get a palindrome (42662533526624).
The spelling of 10330330223323 in words is "ten trillion, three hundred thirty billion, three hundred thirty million, two hundred twenty-three thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •