Base | Representation |
---|---|
bin | 11000010001011011… |
… | …101011001111001000 |
3 | 2111021022202120021022 |
4 | 120101123223033020 |
5 | 411333420141212 |
6 | 15550044532012 |
7 | 1611563436431 |
oct | 302133531710 |
9 | 74238676238 |
10 | 26062271432 |
11 | 100645222aa |
12 | 5074251008 |
13 | 25c46374b2 |
14 | 13934a4488 |
15 | a280a4772 |
hex | 6116eb3c8 |
26062271432 has 12 divisors (see below), whose sum is σ = 48867615105. Its totient is φ = 13030907408.
The previous prime is 26062271419. The next prime is 26062271449. The reversal of 26062271432 is 23417226062.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 2 ways, for example, as 24116226436 + 1946044996 = 155294^2 + 44114^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=114154.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 26062271392 and 26062271401.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 428078 + ... + 485154.
Almost surely, 226062271432 is an apocalyptic number.
It is an amenable number.
26062271432 is a deficient number, since it is larger than the sum of its proper divisors (22805343673).
26062271432 is an frugal number, since it uses more digits than its factorization.
26062271432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114160 (or 57079 counting only the distinct ones).
The product of its (nonzero) digits is 48384, while the sum is 35.
Adding to 26062271432 its reverse (23417226062), we get a palindrome (49479497494).
The spelling of 26062271432 in words is "twenty-six billion, sixty-two million, two hundred seventy-one thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •