Base | Representation |
---|---|
bin | 10011001111011110010111… |
… | …10110111010000011100001 |
3 | 12112211002121200120112102002 |
4 | 21213233023312322003201 |
5 | 21021224304102020223 |
6 | 225554220050333345 |
7 | 11625011062122302 |
oct | 1147571366720341 |
9 | 175732550515362 |
10 | 42313143001313 |
11 | 125339a3139608 |
12 | 48b46a1b8a255 |
13 | 1a7c15c84a892 |
14 | a63d7781c7a9 |
15 | 4d59de155e28 |
hex | 267bcbdba0e1 |
42313143001313 has 8 divisors (see below), whose sum is σ = 43965046054080. Its totient is φ = 40674095225680.
The previous prime is 42313143001289. The next prime is 42313143001333. The reversal of 42313143001313 is 31310034131324.
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 42313143001313 - 26 = 42313143001249 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (42313143001333) 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, 3213812573 + ... + 3213825738.
It is an arithmetic number, because the mean of its divisors is an integer number (5495630756760).
Almost surely, 242313143001313 is an apocalyptic number.
It is an amenable number.
42313143001313 is a deficient number, since it is larger than the sum of its proper divisors (1651903052767).
42313143001313 is a wasteful number, since it uses less digits than its factorization.
42313143001313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6427638567.
The product of its (nonzero) digits is 7776, while the sum is 29.
Adding to 42313143001313 its reverse (31310034131324), we get a palindrome (73623177132637).
The spelling of 42313143001313 in words is "forty-two trillion, three hundred thirteen billion, one hundred forty-three million, one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •