Base | Representation |
---|---|
bin | 11110010011000011111111… |
… | …000101111111100001101110 |
3 | 122110210201000100112020010201 |
4 | 132103003333011333201232 |
5 | 114431142223324331420 |
6 | 1151222453424224114 |
7 | 40032043360412563 |
oct | 3623037705774156 |
9 | 573721010466121 |
10 | 133251345152110 |
11 | 3950463a534909 |
12 | 12b41005a6b03a |
13 | 5947717a5a863 |
14 | 24c95843bc86a |
15 | 106128ec6510a |
hex | 7930ff17f86e |
133251345152110 has 8 divisors (see below), whose sum is σ = 239852421273816. Its totient is φ = 53300538060840.
The previous prime is 133251345152099. The next prime is 133251345152141. The reversal of 133251345152110 is 11251543152331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 133251345152110.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6662567257596 + ... + 6662567257615.
It is an arithmetic number, because the mean of its divisors is an integer number (29981552659227).
Almost surely, 2133251345152110 is an apocalyptic number.
133251345152110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
133251345152110 is a deficient number, since it is larger than the sum of its proper divisors (106601076121706).
133251345152110 is a wasteful number, since it uses less digits than its factorization.
133251345152110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13325134515218.
The product of its (nonzero) digits is 54000, while the sum is 37.
The spelling of 133251345152110 in words is "one hundred thirty-three trillion, two hundred fifty-one billion, three hundred forty-five million, one hundred fifty-two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •