Base | Representation |
---|---|
bin | 11111111000011001011011… |
… | …101010010000111111001101 |
3 | 200101110102112020020002021210 |
4 | 133320121123222100333031 |
5 | 121334240400234322001 |
6 | 1214113522235445033 |
7 | 41351126256311220 |
oct | 3770313352207715 |
9 | 611412466202253 |
10 | 140215040151501 |
11 | 40749956848917 |
12 | 138867452b6779 |
13 | 60312b59963b3 |
14 | 268a630a855b7 |
15 | 11324ad056dd6 |
hex | 7f865ba90fcd |
140215040151501 has 16 divisors (see below), whose sum is σ = 213712386867200. Its totient is φ = 80103615097968.
The previous prime is 140215040151499. The next prime is 140215040151503. The reversal of 140215040151501 is 105151040512041.
It is an interprime number because it is at equal distance from previous prime (140215040151499) and next prime (140215040151503).
It is not a de Polignac number, because 140215040151501 - 21 = 140215040151499 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140215040151503) 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, 802618441 + ... + 802793118.
It is an arithmetic number, because the mean of its divisors is an integer number (13357024179200).
Almost surely, 2140215040151501 is an apocalyptic number.
It is an amenable number.
140215040151501 is a deficient number, since it is larger than the sum of its proper divisors (73497346715699).
140215040151501 is a wasteful number, since it uses less digits than its factorization.
140215040151501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1605415728.
The product of its (nonzero) digits is 4000, while the sum is 30.
Adding to 140215040151501 its reverse (105151040512041), we get a palindrome (245366080663542).
The spelling of 140215040151501 in words is "one hundred forty trillion, two hundred fifteen billion, forty million, one hundred fifty-one thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •