Base | Representation |
---|---|
bin | 100101011110001110001… |
… | …1101010101110001110011 |
3 | 200020100102100010001110020 |
4 | 1022330130131111301303 |
5 | 1133334443132210311 |
6 | 14541535415134523 |
7 | 1041041231153454 |
oct | 112743435256163 |
9 | 20210370101406 |
10 | 5150143241331 |
11 | 1706188660a80 |
12 | 6b2170674443 |
13 | 2b486c2171ba |
14 | 13b3a818312b |
15 | 8de78b97c06 |
hex | 4af1c755c73 |
5150143241331 has 32 divisors (see below), whose sum is σ = 7650809856000. Its totient is φ = 3054765758880.
The previous prime is 5150143241323. The next prime is 5150143241389. The reversal of 5150143241331 is 1331423410515.
It is not a de Polignac number, because 5150143241331 - 23 = 5150143241323 is a prime.
It is a super-2 number, since 2×51501432413312 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 5150143241292 and 5150143241301.
It is not an unprimeable number, because it can be changed into a prime (5150143241231) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 51441640 + ... + 51541658.
It is an arithmetic number, because the mean of its divisors is an integer number (239087808000).
Almost surely, 25150143241331 is an apocalyptic number.
5150143241331 is a deficient number, since it is larger than the sum of its proper divisors (2500666614669).
5150143241331 is a wasteful number, since it uses less digits than its factorization.
5150143241331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 133279.
The product of its (nonzero) digits is 21600, while the sum is 33.
Adding to 5150143241331 its reverse (1331423410515), we get a palindrome (6481566651846).
The spelling of 5150143241331 in words is "five trillion, one hundred fifty billion, one hundred forty-three million, two hundred forty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •