Base | Representation |
---|---|
bin | 10101100010101111111010… |
… | …11011000001110000101000 |
3 | 20012201212010220110211111021 |
4 | 22301113331123001300220 |
5 | 22202131304140401303 |
6 | 244431021034142224 |
7 | 12656422104140020 |
oct | 1261277533016050 |
9 | 205655126424437 |
10 | 47373446028328 |
11 | 14104a69294882 |
12 | 539135b281974 |
13 | 20583b2089844 |
14 | b9ac5bdb8a80 |
15 | 57245a9d5ebd |
hex | 2b15fd6c1c28 |
47373446028328 has 64 divisors (see below), whose sum is σ = 109307766211200. Its totient is φ = 18784742000640.
The previous prime is 47373446028263. The next prime is 47373446028329. The reversal of 47373446028328 is 82382064437374.
47373446028328 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (47373446028329) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 421655893 + ... + 421768228.
It is an arithmetic number, because the mean of its divisors is an integer number (1707933847050).
Almost surely, 247373446028328 is an apocalyptic number.
It is an amenable number.
47373446028328 is an abundant number, since it is smaller than the sum of its proper divisors (61934320182872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
47373446028328 is a wasteful number, since it uses less digits than its factorization.
47373446028328 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 843424210 (or 843424206 counting only the distinct ones).
The product of its (nonzero) digits is 130056192, while the sum is 61.
The spelling of 47373446028328 in words is "forty-seven trillion, three hundred seventy-three billion, four hundred forty-six million, twenty-eight thousand, three hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •