Base | Representation |
---|---|
bin | 1000001110110010111… |
… | …0110111000101100100 |
3 | 111112000011002212110002 |
4 | 2003230232313011210 |
5 | 4304102112120313 |
6 | 144544013120432 |
7 | 13134200532512 |
oct | 2035456670544 |
9 | 445004085402 |
10 | 141410660708 |
11 | 54a766a4439 |
12 | 234a6189118 |
13 | 10447c03c85 |
14 | 6bb6b174b2 |
15 | 3a299c0058 |
hex | 20ecbb7164 |
141410660708 has 24 divisors (see below), whose sum is σ = 260735250048. Its totient is φ = 66974567616.
The previous prime is 141410660647. The next prime is 141410660717. The reversal of 141410660708 is 807066014141.
141410660708 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1414106607082 (a number of 23 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (38) coincides with the sum of the digits of its prime factors.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7452041 + ... + 7470992.
It is an arithmetic number, because the mean of its divisors is an integer number (10863968752).
Almost surely, 2141410660708 is an apocalyptic number.
It is an amenable number.
141410660708 is a deficient number, since it is larger than the sum of its proper divisors (119324589340).
141410660708 is a wasteful number, since it uses less digits than its factorization.
141410660708 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14923163 (or 14923161 counting only the distinct ones).
The product of its (nonzero) digits is 32256, while the sum is 38.
Adding to 141410660708 its reverse (807066014141), we get a palindrome (948476674849).
The spelling of 141410660708 in words is "one hundred forty-one billion, four hundred ten million, six hundred sixty thousand, seven hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •