Base | Representation |
---|---|
bin | 10101010100011010111010… |
… | …00000110001111101001110 |
3 | 20010222210101110020012201202 |
4 | 22222031131000301331032 |
5 | 22121100022400142200 |
6 | 243412520525305502 |
7 | 12606023032314641 |
oct | 1252153500617516 |
9 | 203883343205652 |
10 | 46881128521550 |
11 | 13a351a1953234 |
12 | 5311a63105292 |
13 | 2020b4376475b |
14 | b810b720da58 |
15 | 5647445821d5 |
hex | 2aa35d031f4e |
46881128521550 has 48 divisors (see below), whose sum is σ = 87857195862912. Its totient is φ = 18611162294400.
The previous prime is 46881128521541. The next prime is 46881128521553. The reversal of 46881128521550 is 5512582118864.
46881128521550 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×468811285215502 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (46881128521553) 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 23 ways as a sum of consecutive naturals, for example, 3195395 + ... + 10196705.
It is an arithmetic number, because the mean of its divisors is an integer number (1830358247144).
Almost surely, 246881128521550 is an apocalyptic number.
46881128521550 is a deficient number, since it is larger than the sum of its proper divisors (40976067341362).
46881128521550 is a wasteful number, since it uses less digits than its factorization.
46881128521550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7002333 (or 7002328 counting only the distinct ones).
The product of its (nonzero) digits is 6144000, while the sum is 56.
The spelling of 46881128521550 in words is "forty-six trillion, eight hundred eighty-one billion, one hundred twenty-eight million, five hundred twenty-one thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •