Base | Representation |
---|---|
bin | 11100000000110111011001… |
… | …001110101001011110110000 |
3 | 121011020021002001100100022121 |
4 | 130000313121032221132300 |
5 | 112122041343013202202 |
6 | 1114011254544044024 |
7 | 34644152223362203 |
oct | 3400673116513660 |
9 | 534207061310277 |
10 | 123204781381552 |
11 | 36290944169892 |
12 | 11999ab4003614 |
13 | 5399212a319a0 |
14 | 225d20107b93a |
15 | e39c8be8e537 |
hex | 700dd93a97b0 |
123204781381552 has 40 divisors (see below), whose sum is σ = 257090270239040. Its totient is φ = 56859596628480.
The previous prime is 123204781381543. The next prime is 123204781381567. The reversal of 123204781381552 is 255183187402321.
It is a Harshad number since it is a multiple of its sum of digits (52).
It is a self number, because there is not a number n which added to its sum of digits gives 123204781381552.
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 7 ways as a sum of consecutive naturals, for example, 18748677 + ... + 24452452.
It is an arithmetic number, because the mean of its divisors is an integer number (6427256755976).
Almost surely, 2123204781381552 is an apocalyptic number.
It is an amenable number.
123204781381552 is an abundant number, since it is smaller than the sum of its proper divisors (133885488857488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
123204781381552 is a wasteful number, since it uses less digits than its factorization.
123204781381552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43214861 (or 43214855 counting only the distinct ones).
The product of its (nonzero) digits is 3225600, while the sum is 52.
The spelling of 123204781381552 in words is "one hundred twenty-three trillion, two hundred four billion, seven hundred eighty-one million, three hundred eighty-one thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •