Base | Representation |
---|---|
bin | 111100011010111001011… |
… | …111011001010100001111 |
3 | 112200221011112101111110100 |
4 | 330122321133121110033 |
5 | 1021011344402014210 |
6 | 12455231534142143 |
7 | 605655452165133 |
oct | 74327137312417 |
9 | 15627145344410 |
10 | 4152050423055 |
11 | 1360969246a27 |
12 | 570841351953 |
13 | 2416c90c8072 |
14 | 104d631533c3 |
15 | 7300eaac5c0 |
hex | 3c6b97d950f |
4152050423055 has 12 divisors (see below), whose sum is σ = 7196887400040. Its totient is φ = 2214426892272.
The previous prime is 4152050423047. The next prime is 4152050423057. The reversal of 4152050423055 is 5503240502514.
4152050423055 is a `hidden beast` number, since 4 + 1 + 520 + 50 + 4 + 2 + 30 + 55 = 666.
It is not a de Polignac number, because 4152050423055 - 23 = 4152050423047 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4152050423057) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 46133893545 + ... + 46133893634.
It is an arithmetic number, because the mean of its divisors is an integer number (599740616670).
Almost surely, 24152050423055 is an apocalyptic number.
4152050423055 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
4152050423055 is a deficient number, since it is larger than the sum of its proper divisors (3044836976985).
4152050423055 is a wasteful number, since it uses less digits than its factorization.
4152050423055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92267787190 (or 92267787187 counting only the distinct ones).
The product of its (nonzero) digits is 120000, while the sum is 36.
Adding to 4152050423055 its reverse (5503240502514), we get a palindrome (9655290925569).
The spelling of 4152050423055 in words is "four trillion, one hundred fifty-two billion, fifty million, four hundred twenty-three thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •