Base | Representation |
---|---|
bin | 1001001110001111110000… |
… | …0011010000110100101101 |
3 | 1022220102000112101211021121 |
4 | 2103203330003100310231 |
5 | 2312114414443013313 |
6 | 33322225125300541 |
7 | 2064421235602231 |
oct | 223437403206455 |
9 | 38812015354247 |
10 | 10140351532333 |
11 | 325a554099650 |
12 | 1179327264751 |
13 | 5873007bbcc9 |
14 | 270b1d3065c1 |
15 | 128b9195228d |
hex | 938fc0d0d2d |
10140351532333 has 8 divisors (see below), whose sum is σ = 11062269621216. Its totient is φ = 9218444768400.
The previous prime is 10140351532303. The next prime is 10140351532379. The reversal of 10140351532333 is 33323515304101.
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-10140351532333 is a prime.
It is a super-2 number, since 2×101403515323332 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10140351532303) 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, 901866 + ... + 4592827.
It is an arithmetic number, because the mean of its divisors is an integer number (1382783702652).
Almost surely, 210140351532333 is an apocalyptic number.
It is an amenable number.
10140351532333 is a deficient number, since it is larger than the sum of its proper divisors (921918088883).
10140351532333 is a wasteful number, since it uses less digits than its factorization.
10140351532333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5662475.
The product of its (nonzero) digits is 48600, while the sum is 34.
Adding to 10140351532333 its reverse (33323515304101), we get a palindrome (43463866836434).
The spelling of 10140351532333 in words is "ten trillion, one hundred forty billion, three hundred fifty-one million, five hundred thirty-two thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •