Base | Representation |
---|---|
bin | 100000001001110110101111… |
… | …110010100000101100111111 |
3 | 200112201010011220012200020121 |
4 | 200021312233302200230333 |
5 | 122013414400323143001 |
6 | 1220433012123155411 |
7 | 41533610162305252 |
oct | 4011665762405477 |
9 | 615633156180217 |
10 | 141414747474751 |
11 | 410717263025a3 |
12 | 13a3b160975b67 |
13 | 60ba47974869a |
14 | 26cc720385099 |
15 | 11537c71cd6a1 |
hex | 809dafca0b3f |
141414747474751 has 8 divisors (see below), whose sum is σ = 145110674543184. Its totient is φ = 137730572162880.
The previous prime is 141414747474691. The next prime is 141414747474761. The reversal of 141414747474751 is 157474747414141.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 141414747474751 - 29 = 141414747474239 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 141414747474751.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141414747474761) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2937914760 + ... + 2937962893.
It is an arithmetic number, because the mean of its divisors is an integer number (18138834317898).
Almost surely, 2141414747474751 is an apocalyptic number.
141414747474751 is a deficient number, since it is larger than the sum of its proper divisors (3695927068433).
141414747474751 is an equidigital number, since it uses as much as digits as its factorization.
141414747474751 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5875878281.
The product of its digits is 49172480, while the sum is 61.
The spelling of 141414747474751 in words is "one hundred forty-one trillion, four hundred fourteen billion, seven hundred forty-seven million, four hundred seventy-four thousand, seven hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •