Base | Representation |
---|---|
bin | 1000001110010110010… |
… | …0001110111100000110 |
3 | 111111200202212201211112 |
4 | 2003211210032330012 |
5 | 4303330322344220 |
6 | 144524040205022 |
7 | 13131210606314 |
oct | 2034544167406 |
9 | 444622781745 |
10 | 141290434310 |
11 | 54a14848583 |
12 | 23471a69772 |
13 | 1042902acac |
14 | 6ba4b7d0b4 |
15 | 3a1e1725c5 |
hex | 20e590ef06 |
141290434310 has 8 divisors (see below), whose sum is σ = 254322781776. Its totient is φ = 56516173720.
The previous prime is 141290434309. The next prime is 141290434321. The reversal of 141290434310 is 13434092141.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1412904343102 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 7064521706 + ... + 7064521725.
It is an arithmetic number, because the mean of its divisors is an integer number (31790347722).
Almost surely, 2141290434310 is an apocalyptic number.
141290434310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
141290434310 is a deficient number, since it is larger than the sum of its proper divisors (113032347466).
141290434310 is a wasteful number, since it uses less digits than its factorization.
141290434310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14129043438.
The product of its (nonzero) digits is 10368, while the sum is 32.
The spelling of 141290434310 in words is "one hundred forty-one billion, two hundred ninety million, four hundred thirty-four thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •