Base | Representation |
---|---|
bin | 1001001110111111101110… |
… | …1011111111100010111110 |
3 | 1022221122021002010202002012 |
4 | 2103233323223333202332 |
5 | 2312322303431143032 |
6 | 33332155110531222 |
7 | 2065355340605330 |
oct | 223577353774276 |
9 | 38848232122065 |
10 | 10153230334142 |
11 | 3264a62914005 |
12 | 117b920366b12 |
13 | 5885a3a375ac |
14 | 2715c1923450 |
15 | 1291974136b2 |
hex | 93bfbaff8be |
10153230334142 has 8 divisors (see below), whose sum is σ = 17405537715696. Its totient is φ = 4351384428912.
The previous prime is 10153230334103. The next prime is 10153230334183. The reversal of 10153230334142 is 24143303235101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×101532303341423 (a number of 40 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10153230334099 and 10153230334108.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 362615369063 + ... + 362615369090.
It is an arithmetic number, because the mean of its divisors is an integer number (2175692214462).
Almost surely, 210153230334142 is an apocalyptic number.
10153230334142 is a deficient number, since it is larger than the sum of its proper divisors (7252307381554).
10153230334142 is an equidigital number, since it uses as much as digits as its factorization.
10153230334142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 725230738162.
The product of its (nonzero) digits is 25920, while the sum is 32.
Adding to 10153230334142 its reverse (24143303235101), we get a palindrome (34296533569243).
The spelling of 10153230334142 in words is "ten trillion, one hundred fifty-three billion, two hundred thirty million, three hundred thirty-four thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •