Base | Representation |
---|---|
bin | 1000011100010110111… |
… | …1001110011010100011 |
3 | 111212101212211012111101 |
4 | 2013011233032122203 |
5 | 4334031130142011 |
6 | 150345151055231 |
7 | 13323336442243 |
oct | 2070557163243 |
9 | 455355735441 |
10 | 145051412131 |
11 | 5657481690a |
12 | 24141511517 |
13 | 108a8281962 |
14 | 7040473b23 |
15 | 3b8e4312c1 |
hex | 21c5bce6a3 |
145051412131 has 8 divisors (see below), whose sum is σ = 152704601280. Its totient is φ = 137400113448.
The previous prime is 145051412123. The next prime is 145051412167. The reversal of 145051412131 is 131214150541.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 145051412131 - 23 = 145051412123 is a prime.
It is a super-2 number, since 2×1450514121312 (a number of 23 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 145051412131.
It is not an unprimeable number, because it can be changed into a prime (145057412131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 313741 + ... + 623326.
It is an arithmetic number, because the mean of its divisors is an integer number (19088075160).
Almost surely, 2145051412131 is an apocalyptic number.
145051412131 is a deficient number, since it is larger than the sum of its proper divisors (7653189149).
145051412131 is an equidigital number, since it uses as much as digits as its factorization.
145051412131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 945233.
The product of its (nonzero) digits is 2400, while the sum is 28.
Adding to 145051412131 its reverse (131214150541), we get a palindrome (276265562672).
The spelling of 145051412131 in words is "one hundred forty-five billion, fifty-one million, four hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •