Base | Representation |
---|---|
bin | 10011001111101011100100… |
… | …00100101100110100100011 |
3 | 12112211202220100121202011021 |
4 | 21213311302010230310203 |
5 | 21021333311002233100 |
6 | 230001351012430311 |
7 | 11625351444543166 |
oct | 1147656204546443 |
9 | 175752810552137 |
10 | 42320226602275 |
11 | 125369a86a3886 |
12 | 48b5b3a318397 |
13 | 1a7ca1b274c3b |
14 | a6444a4dbadd |
15 | 4d5ca5e85a1a |
hex | 267d7212cd23 |
42320226602275 has 24 divisors (see below), whose sum is σ = 52613857457424. Its totient is φ = 33768051504000.
The previous prime is 42320226602243. The next prime is 42320226602281. The reversal of 42320226602275 is 57220662202324.
42320226602275 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 42320226602275 - 25 = 42320226602243 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 13561725 + ... + 16387825.
It is an arithmetic number, because the mean of its divisors is an integer number (2192244060726).
Almost surely, 242320226602275 is an apocalyptic number.
42320226602275 is a deficient number, since it is larger than the sum of its proper divisors (10293630855149).
42320226602275 is a wasteful number, since it uses less digits than its factorization.
42320226602275 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2827671 (or 2827666 counting only the distinct ones).
The product of its (nonzero) digits is 967680, while the sum is 43.
Adding to 42320226602275 its reverse (57220662202324), we get a palindrome (99540888804599).
The spelling of 42320226602275 in words is "forty-two trillion, three hundred twenty billion, two hundred twenty-six million, six hundred two thousand, two hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •