Base | Representation |
---|---|
bin | 1001011001011101111100… |
… | …1101010010110110101001 |
3 | 1100120211122101002012020220 |
4 | 2112113133031102312221 |
5 | 2323244233113314040 |
6 | 33550551324040253 |
7 | 2114354604404601 |
oct | 226273715226651 |
9 | 40524571065226 |
10 | 10333141151145 |
11 | 332429588272a |
12 | 11aa770093089 |
13 | 59c546054a27 |
14 | 27a1ab945c01 |
15 | 12dbc6da22d0 |
hex | 965df352da9 |
10333141151145 has 8 divisors (see below), whose sum is σ = 16533025841856. Its totient is φ = 5511008613936.
The previous prime is 10333141151131. The next prime is 10333141151171. The reversal of 10333141151145 is 54115114133301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10333141151145 - 28 = 10333141150889 is a prime.
It is a super-2 number, since 2×103331411511452 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 344438038357 + ... + 344438038386.
It is an arithmetic number, because the mean of its divisors is an integer number (2066628230232).
Almost surely, 210333141151145 is an apocalyptic number.
10333141151145 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10333141151145 is a deficient number, since it is larger than the sum of its proper divisors (6199884690711).
10333141151145 is an equidigital number, since it uses as much as digits as its factorization.
10333141151145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 688876076751.
The product of its (nonzero) digits is 10800, while the sum is 33.
Adding to 10333141151145 its reverse (54115114133301), we get a palindrome (64448255284446).
The spelling of 10333141151145 in words is "ten trillion, three hundred thirty-three billion, one hundred forty-one million, one hundred fifty-one thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •