Base | Representation |
---|---|
bin | 111110001101000011010… |
… | …101110111010110010100 |
3 | 120010122112202221012110221 |
4 | 332031003111313112110 |
5 | 1030013411244432344 |
6 | 13031422342124124 |
7 | 620555060513200 |
oct | 76150325672624 |
9 | 16118482835427 |
10 | 4274622264724 |
11 | 13a8947913829 |
12 | 59054a420644 |
13 | 250131076726 |
14 | 10ac6dc8bb00 |
15 | 762d5730184 |
hex | 3e343577594 |
4274622264724 has 72 divisors (see below), whose sum is σ = 9166027500000. Its totient is φ = 1734400842048.
The previous prime is 4274622264719. The next prime is 4274622264739.
4274622264724 is nontrivially palindromic in base 10.
It is a congruent 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, 5199402 + ... + 5965150.
It is an arithmetic number, because the mean of its divisors is an integer number (127305937500).
Almost surely, 24274622264724 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 4274622264724, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4583013750000).
4274622264724 is an abundant number, since it is smaller than the sum of its proper divisors (4891405235276).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4274622264724 is a wasteful number, since it uses less digits than its factorization.
4274622264724 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 767285 (or 767276 counting only the distinct ones).
The product of its digits is 14450688, while the sum is 52.
The spelling of 4274622264724 in words is "four trillion, two hundred seventy-four billion, six hundred twenty-two million, two hundred sixty-four thousand, seven hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •