Base | Representation |
---|---|
bin | 10110110010101110011000… |
… | …11100111011110010101111 |
3 | 20120110120002210021202221110 |
4 | 23121113030130323302233 |
5 | 23032142113244422111 |
6 | 254333242132003103 |
7 | 13362103050313143 |
oct | 1331271434736257 |
9 | 216416083252843 |
10 | 50121403514031 |
11 | 14a74405692063 |
12 | 5755a44760493 |
13 | 21c7574619405 |
14 | c53c630d9223 |
15 | 5bdb8ce515a6 |
hex | 2d95cc73bcaf |
50121403514031 has 16 divisors (see below), whose sum is σ = 68369517676800. Its totient is φ = 32652108800640.
The previous prime is 50121403514003. The next prime is 50121403514051. The reversal of 50121403514031 is 13041530412105.
It is not a de Polignac number, because 50121403514031 - 213 = 50121403505839 is a prime.
It is a super-2 number, since 2×501214035140312 (a number of 28 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 50121403514031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50121403514051) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1041178381 + ... + 1041226518.
It is an arithmetic number, because the mean of its divisors is an integer number (4273094854800).
Almost surely, 250121403514031 is an apocalyptic number.
50121403514031 is a deficient number, since it is larger than the sum of its proper divisors (18248114162769).
50121403514031 is a wasteful number, since it uses less digits than its factorization.
50121403514031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2082405086.
The product of its (nonzero) digits is 7200, while the sum is 30.
Adding to 50121403514031 its reverse (13041530412105), we get a palindrome (63162933926136).
The spelling of 50121403514031 in words is "fifty trillion, one hundred twenty-one billion, four hundred three million, five hundred fourteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •