Base | Representation |
---|---|
bin | 1000001110111110110… |
… | …1110100100111000111 |
3 | 111112010122022010222120 |
4 | 2003233231310213013 |
5 | 4304202421020241 |
6 | 144553002101023 |
7 | 13135346165256 |
oct | 2035755644707 |
9 | 445118263876 |
10 | 141460720071 |
11 | 54aa1985810 |
12 | 234baaaa773 |
13 | 104553b03b8 |
14 | 6bbd62879d |
15 | 3a2e0ac666 |
hex | 20efb749c7 |
141460720071 has 16 divisors (see below), whose sum is σ = 205821924480. Its totient is φ = 85708404320.
The previous prime is 141460720069. The next prime is 141460720073. The reversal of 141460720071 is 170027064141.
It is an interprime number because it is at equal distance from previous prime (141460720069) and next prime (141460720073).
It is not a de Polignac number, because 141460720071 - 21 = 141460720069 is a prime.
It is a super-2 number, since 2×1414607200712 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141460720073) 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, 520605 + ... + 744278.
It is an arithmetic number, because the mean of its divisors is an integer number (12863870280).
Almost surely, 2141460720071 is an apocalyptic number.
141460720071 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
141460720071 is a deficient number, since it is larger than the sum of its proper divisors (64361204409).
141460720071 is a wasteful number, since it uses less digits than its factorization.
141460720071 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1268286.
The product of its (nonzero) digits is 9408, while the sum is 33.
The spelling of 141460720071 in words is "one hundred forty-one billion, four hundred sixty million, seven hundred twenty thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •