Base | Representation |
---|---|
bin | 100000010001001001110010… |
… | …010110000001111001000100 |
3 | 200121111001120220212021112010 |
4 | 200101021302112001321010 |
5 | 122100123413302200342 |
6 | 1221455225350254220 |
7 | 41615052264432153 |
oct | 4021116226017104 |
9 | 617431526767463 |
10 | 141916227771972 |
11 | 41245374913225 |
12 | 13b00395657370 |
13 | 612584847a674 |
14 | 2708ad401d59a |
15 | 1161877c6829c |
hex | 811272581e44 |
141916227771972 has 24 divisors (see below), whose sum is σ = 331138236917376. Its totient is φ = 47305356097888.
The previous prime is 141916227771953. The next prime is 141916227771977. The reversal of 141916227771972 is 279177722619141.
It is not an unprimeable number, because it can be changed into a prime (141916227771977) 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 7 ways as a sum of consecutive naturals, for example, 5343733 + ... + 17674499.
It is an arithmetic number, because the mean of its divisors is an integer number (13797426538224).
Almost surely, 2141916227771972 is an apocalyptic number.
141916227771972 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
141916227771972 is an abundant number, since it is smaller than the sum of its proper divisors (189222009145404).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141916227771972 is a wasteful number, since it uses less digits than its factorization.
141916227771972 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13289867 (or 13289865 counting only the distinct ones).
The product of its digits is 37340352, while the sum is 66.
The spelling of 141916227771972 in words is "one hundred forty-one trillion, nine hundred sixteen billion, two hundred twenty-seven million, seven hundred seventy-one thousand, nine hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •