Base | Representation |
---|---|
bin | 1000001101010101110… |
… | …0101001011000100101 |
3 | 111110222221000202110010 |
4 | 2003111130221120211 |
5 | 4302302110310041 |
6 | 144441140120433 |
7 | 13121415210312 |
oct | 2032534513045 |
9 | 443887022403 |
10 | 141020010021 |
11 | 54896134830 |
12 | 233b7396119 |
13 | 103b4cb7017 |
14 | 6b7aca7d09 |
15 | 3a05556a16 |
hex | 20d5729625 |
141020010021 has 16 divisors (see below), whose sum is σ = 205266700800. Its totient is φ = 85405553520.
The previous prime is 141020010017. The next prime is 141020010041. The reversal of 141020010021 is 120010020141.
It is a happy number.
It is not a de Polignac number, because 141020010021 - 22 = 141020010017 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 141020009979 and 141020010006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141020010041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1481115 + ... + 1573448.
It is an arithmetic number, because the mean of its divisors is an integer number (12829168800).
Almost surely, 2141020010021 is an apocalyptic number.
141020010021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
141020010021 is a deficient number, since it is larger than the sum of its proper divisors (64246690779).
141020010021 is a wasteful number, since it uses less digits than its factorization.
141020010021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3055976.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 141020010021 its reverse (120010020141), we get a palindrome (261030030162).
The spelling of 141020010021 in words is "one hundred forty-one billion, twenty million, ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.199 sec. • engine limits •