Base | Representation |
---|---|
bin | 1001001110010111100010… |
… | …0111001001010000101011 |
3 | 1022220121102011200200212112 |
4 | 2103211320213021100223 |
5 | 2312133204434011243 |
6 | 33323212340432535 |
7 | 2064524102465204 |
oct | 223457047112053 |
9 | 38817364620775 |
10 | 10142441313323 |
11 | 3260426787a80 |
12 | 117980b0a874b |
13 | 58757473c6c7 |
14 | 270c7aa925ab |
15 | 128c6514b818 |
hex | 939789c942b |
10142441313323 has 8 divisors (see below), whose sum is σ = 11174030755056. Its totient is φ = 9129110092000.
The previous prime is 10142441313311. The next prime is 10142441313343. The reversal of 10142441313323 is 32331314424101.
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 10142441313323 - 26 = 10142441313259 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 10142441313323.
It is not an unprimeable number, because it can be changed into a prime (10142441313343) 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, 4564553936 + ... + 4564556157.
It is an arithmetic number, because the mean of its divisors is an integer number (1396753844382).
Almost surely, 210142441313323 is an apocalyptic number.
10142441313323 is a deficient number, since it is larger than the sum of its proper divisors (1031589441733).
10142441313323 is a wasteful number, since it uses less digits than its factorization.
10142441313323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9129110205.
The product of its (nonzero) digits is 20736, while the sum is 32.
Adding to 10142441313323 its reverse (32331314424101), we get a palindrome (42473755737424).
The spelling of 10142441313323 in words is "ten trillion, one hundred forty-two billion, four hundred forty-one million, three hundred thirteen thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •