Base | Representation |
---|---|
bin | 1000001101011000001… |
… | …1111100110100011011 |
3 | 111111000122102012210221 |
4 | 2003112003330310123 |
5 | 4302312230010433 |
6 | 144442145020511 |
7 | 13121601612001 |
oct | 2032603746433 |
9 | 444018365727 |
10 | 141030313243 |
11 | 548a0a31796 |
12 | 233ba924737 |
13 | 103b71838c1 |
14 | 6b7c3caa71 |
15 | 3a063de72d |
hex | 20d60fcd1b |
141030313243 has 8 divisors (see below), whose sum is σ = 149331704112. Its totient is φ = 132729532416.
The previous prime is 141030313241. The next prime is 141030313247. The reversal of 141030313243 is 342313030141.
141030313243 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 141030313243 - 21 = 141030313241 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (141030313241) by changing a digit.
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, 375771 + ... + 650587.
It is an arithmetic number, because the mean of its divisors is an integer number (18666463014).
Almost surely, 2141030313243 is an apocalyptic number.
141030313243 is a deficient number, since it is larger than the sum of its proper divisors (8301390869).
141030313243 is a wasteful number, since it uses less digits than its factorization.
141030313243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 305021.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 141030313243 its reverse (342313030141), we get a palindrome (483343343384).
The spelling of 141030313243 in words is "one hundred forty-one billion, thirty million, three hundred thirteen thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •