Base | Representation |
---|---|
bin | 100101011110010001010… |
… | …0011001101011010011111 |
3 | 200020100200110102110002210 |
4 | 1022330202203031122133 |
5 | 1133340200313140411 |
6 | 14541553505451503 |
7 | 1041043611646260 |
oct | 112744243153237 |
9 | 20210613373083 |
10 | 5150245443231 |
11 | 1706230316859 |
12 | 6b219a940b93 |
13 | 2b488744bcb5 |
14 | 13b3b7988967 |
15 | 8de82b34ca6 |
hex | 4af228cd69f |
5150245443231 has 16 divisors (see below), whose sum is σ = 7848047687168. Its totient is φ = 2942976909600.
The previous prime is 5150245443209. The next prime is 5150245443263. The reversal of 5150245443231 is 1323445420515.
It is not a de Polignac number, because 5150245443231 - 210 = 5150245442207 is a prime.
It is a super-2 number, since 2×51502454432312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5150245443231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5150245453231) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 2550726 + ... + 4099596.
It is an arithmetic number, because the mean of its divisors is an integer number (490502980448).
Almost surely, 25150245443231 is an apocalyptic number.
5150245443231 is a deficient number, since it is larger than the sum of its proper divisors (2697802243937).
5150245443231 is a wasteful number, since it uses less digits than its factorization.
5150245443231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1707222.
The product of its (nonzero) digits is 288000, while the sum is 39.
The spelling of 5150245443231 in words is "five trillion, one hundred fifty billion, two hundred forty-five million, four hundred forty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •