Base | Representation |
---|---|
bin | 10100100110110111000000… |
… | …10011100111100110100110 |
3 | 12221110010122211110210212220 |
4 | 22103123200103213212212 |
5 | 21414422442030242014 |
6 | 240213421450053210 |
7 | 12354643334246145 |
oct | 1223334023474646 |
9 | 187403584423786 |
10 | 45315668212134 |
11 | 134912a3368581 |
12 | 50ba59171a206 |
13 | 1c39331596068 |
14 | b2940bc4975c |
15 | 538b704056a9 |
hex | 2936e04e79a6 |
45315668212134 has 8 divisors (see below), whose sum is σ = 90631336424280. Its totient is φ = 15105222737376.
The previous prime is 45315668212123. The next prime is 45315668212163. The reversal of 45315668212134 is 43121286651354.
45315668212134 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
45315668212134 is an admirable number.
It is a congruent number.
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 3 ways as a sum of consecutive naturals, for example, 3776305684339 + ... + 3776305684350.
It is an arithmetic number, because the mean of its divisors is an integer number (11328917053035).
Almost surely, 245315668212134 is an apocalyptic number.
45315668212134 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
45315668212134 is a wasteful number, since it uses less digits than its factorization.
45315668212134 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7552611368694.
The product of its digits is 4147200, while the sum is 51.
The spelling of 45315668212134 in words is "forty-five trillion, three hundred fifteen billion, six hundred sixty-eight million, two hundred twelve thousand, one hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •