Base | Representation |
---|---|
bin | 1000001111001000110… |
… | …0001111110110111111 |
3 | 111112020112110002221001 |
4 | 2003302030033312333 |
5 | 4304244034003211 |
6 | 145001044151131 |
7 | 13136362166113 |
oct | 2036214176677 |
9 | 445215402831 |
10 | 141502250431 |
11 | 55013371123 |
12 | 235109984a7 |
13 | 10460b91689 |
14 | 6bc4d59743 |
15 | 3a32a62ac1 |
hex | 20f230fdbf |
141502250431 has 4 divisors (see below), whose sum is σ = 141511295664. Its totient is φ = 141493205200.
The previous prime is 141502250423. The next prime is 141502250467. The reversal of 141502250431 is 134052205141.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 141502250431 - 23 = 141502250423 is a prime.
It is a super-2 number, since 2×1415022504312 (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 141502250431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141502250401) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4499110 + ... + 4530451.
It is an arithmetic number, because the mean of its divisors is an integer number (35377823916).
Almost surely, 2141502250431 is an apocalyptic number.
141502250431 is a deficient number, since it is larger than the sum of its proper divisors (9045233).
141502250431 is an equidigital number, since it uses as much as digits as its factorization.
141502250431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9045232.
The product of its (nonzero) digits is 4800, while the sum is 28.
Adding to 141502250431 its reverse (134052205141), we get a palindrome (275554455572).
The spelling of 141502250431 in words is "one hundred forty-one billion, five hundred two million, two hundred fifty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •