Base | Representation |
---|---|
bin | 10011001110110111110110… |
… | …00001101100000110011100 |
3 | 12112202010020012221211121220 |
4 | 21213123323001230012130 |
5 | 21020404424114123122 |
6 | 225540515423453340 |
7 | 11623346400334563 |
oct | 1147337301540634 |
9 | 175663205854556 |
10 | 42292459520412 |
11 | 12526149923242 |
12 | 48b068b157250 |
13 | 1a7a21469879a |
14 | a62d7485cbda |
15 | 4d51cd3cc25c |
hex | 2676fb06c19c |
42292459520412 has 96 divisors (see below), whose sum is σ = 103722926039040. Its totient is φ = 13386357673920.
The previous prime is 42292459520411. The next prime is 42292459520419. The reversal of 42292459520412 is 21402595429224.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42292459520411) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 501106737 + ... + 501191127.
It is an arithmetic number, because the mean of its divisors is an integer number (1080447146240).
Almost surely, 242292459520412 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 42292459520412, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (51861463019520).
42292459520412 is an abundant number, since it is smaller than the sum of its proper divisors (61430466518628).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42292459520412 is a wasteful number, since it uses less digits than its factorization.
42292459520412 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 97623 (or 97621 counting only the distinct ones).
The product of its (nonzero) digits is 4147200, while the sum is 51.
The spelling of 42292459520412 in words is "forty-two trillion, two hundred ninety-two billion, four hundred fifty-nine million, five hundred twenty thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •