Base | Representation |
---|---|
bin | 111110000101100101011… |
… | …110100010010001011100 |
3 | 120002212212001002101211220 |
4 | 332011211132202101130 |
5 | 1024401001341402234 |
6 | 13024015025013340 |
7 | 620152310234403 |
oct | 76054536422134 |
9 | 16085761071756 |
10 | 4266605028444 |
11 | 13a5503343520 |
12 | 58aa91484250 |
13 | 24c4540aa135 |
14 | 10a70d1b863a |
15 | 75eb697ca49 |
hex | 3e1657a245c |
4266605028444 has 24 divisors (see below), whose sum is σ = 10860449163648. Its totient is φ = 1292910614640.
The previous prime is 4266605028431. The next prime is 4266605028481. The reversal of 4266605028444 is 4448205066624.
4266605028444 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×42666050284442 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16161382552 + ... + 16161382815.
It is an arithmetic number, because the mean of its divisors is an integer number (452518715152).
Almost surely, 24266605028444 is an apocalyptic number.
4266605028444 is a gapful number since it is divisible by the number (44) formed by its first and last digit.
It is an amenable number.
4266605028444 is an abundant number, since it is smaller than the sum of its proper divisors (6593844135204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4266605028444 is a wasteful number, since it uses less digits than its factorization.
4266605028444 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32322765385 (or 32322765383 counting only the distinct ones).
The product of its (nonzero) digits is 8847360, while the sum is 51.
The spelling of 4266605028444 in words is "four trillion, two hundred sixty-six billion, six hundred five million, twenty-eight thousand, four hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •