Base | Representation |
---|---|
bin | 11110010000010011110101… |
… | …111010011001011100000001 |
3 | 122110010121211101011212221212 |
4 | 132100103311322121130001 |
5 | 114420042402403302140 |
6 | 1150555534144255505 |
7 | 40012266446030456 |
oct | 3620236572313401 |
9 | 573117741155855 |
10 | 133062212556545 |
11 | 39441405077498 |
12 | 12b10421911595 |
13 | 593293604c00c |
14 | 24c036173382d |
15 | 105b3c08dc765 |
hex | 7904f5e99701 |
133062212556545 has 32 divisors (see below), whose sum is σ = 167459141836800. Its totient is φ = 101306925720000.
The previous prime is 133062212556503. The next prime is 133062212556587. The reversal of 133062212556545 is 545655212260331.
It is an interprime number because it is at equal distance from previous prime (133062212556503) and next prime (133062212556587).
It is not a de Polignac number, because 133062212556545 - 28 = 133062212556289 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 133062212556493 and 133062212556502.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1115607002 + ... + 1115726268.
It is an arithmetic number, because the mean of its divisors is an integer number (5233098182400).
Almost surely, 2133062212556545 is an apocalyptic number.
It is an amenable number.
133062212556545 is a deficient number, since it is larger than the sum of its proper divisors (34396929280255).
133062212556545 is a wasteful number, since it uses less digits than its factorization.
133062212556545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 168245.
The product of its (nonzero) digits is 6480000, while the sum is 50.
The spelling of 133062212556545 in words is "one hundred thirty-three trillion, sixty-two billion, two hundred twelve million, five hundred fifty-six thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •