Base | Representation |
---|---|
bin | 1000010000111100110… |
… | …1011110000011111010 |
3 | 111120111110120010201022 |
4 | 2010033031132003322 |
5 | 4311243203010020 |
6 | 145121235222442 |
7 | 13154423343566 |
oct | 2041715360372 |
9 | 446443503638 |
10 | 141989110010 |
11 | 55243172a10 |
12 | 23627a47a22 |
13 | 1050a9c5677 |
14 | 6c2d8906a6 |
15 | 3a60682625 |
hex | 210f35e0fa |
141989110010 has 16 divisors (see below), whose sum is σ = 278814979872. Its totient is φ = 51632403600.
The previous prime is 141989109991. The next prime is 141989110049. The reversal of 141989110010 is 10011989141.
141989110010 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×1419891100102 (a number of 23 digits) contains 22 as substring.
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, 645404936 + ... + 645405155.
It is an arithmetic number, because the mean of its divisors is an integer number (17425936242).
Almost surely, 2141989110010 is an apocalyptic number.
141989110010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
141989110010 is a deficient number, since it is larger than the sum of its proper divisors (136825869862).
141989110010 is a wasteful number, since it uses less digits than its factorization.
141989110010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1290810109.
The product of its (nonzero) digits is 2592, while the sum is 35.
The spelling of 141989110010 in words is "one hundred forty-one billion, nine hundred eighty-nine million, one hundred ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •