Search a number
-
+
101514211050052 = 2292683273821011
BaseRepresentation
bin10111000101001110011110…
…011111010100001001000100
3111022102122220220112210211101
4113011032132133110021010
5101301202101012100202
6555522552412345444
730245105532535513
oct2705163637241104
9438378826483741
10101514211050052
112a388a31738829
12b476173a75284
1344849977c41b8
141b0d4579b267a
15bb093e58a887
hex5c539e7d4244

101514211050052 has 12 divisors (see below), whose sum is σ = 177651786733456. Its totient is φ = 50756557697640.

The previous prime is 101514211050013. The next prime is 101514211050073. The reversal of 101514211050052 is 250050112415101.

It is a super-2 number, since 2×1015142110500522 (a number of 29 digits) contains 22 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 101514211050052.

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, 136539774 + ... + 137281237.

Almost surely, 2101514211050052 is an apocalyptic number.

It is an amenable number.

101514211050052 is a deficient number, since it is larger than the sum of its proper divisors (76137575683404).

101514211050052 is a wasteful number, since it uses less digits than its factorization.

101514211050052 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 273913698 (or 273913696 counting only the distinct ones).

The product of its (nonzero) digits is 2000, while the sum is 28.

Adding to 101514211050052 its reverse (250050112415101), we get a palindrome (351564323465153).

The spelling of 101514211050052 in words is "one hundred one trillion, five hundred fourteen billion, two hundred eleven million, fifty thousand, fifty-two".

Divisors: 1 2 4 92683 185366 370732 273821011 547642022 1095284044 25378552762513 50757105525026 101514211050052