Base | Representation |
---|---|
bin | 10011001111001000010000… |
… | …11111011011100011100010 |
3 | 12112202221222121111122200110 |
4 | 21213210020133123203202 |
5 | 21021031002442332422 |
6 | 225544534305432150 |
7 | 11624111015602362 |
oct | 1147441037334342 |
9 | 175687877448613 |
10 | 42301275355362 |
11 | 12529963167551 |
12 | 48b232b63b656 |
13 | 1a7acbac4717a |
14 | a6356d6149a2 |
15 | 4d554732b60c |
hex | 2679087db8e2 |
42301275355362 has 8 divisors (see below), whose sum is σ = 84602550710736. Its totient is φ = 14100425118452.
The previous prime is 42301275355349. The next prime is 42301275355397. The reversal of 42301275355362 is 26355357210324.
42301275355362 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.
42301275355362 is an admirable 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 3 ways as a sum of consecutive naturals, for example, 3525106279608 + ... + 3525106279619.
It is an arithmetic number, because the mean of its divisors is an integer number (10575318838842).
Almost surely, 242301275355362 is an apocalyptic number.
42301275355362 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42301275355362 is a wasteful number, since it uses less digits than its factorization.
42301275355362 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7050212559232.
The product of its (nonzero) digits is 4536000, while the sum is 48.
The spelling of 42301275355362 in words is "forty-two trillion, three hundred one billion, two hundred seventy-five million, three hundred fifty-five thousand, three hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •