Base | Representation |
---|---|
bin | 111111010000111… |
… | …100001001000110 |
3 | 2201222012222021201 |
4 | 333100330021012 |
5 | 4133204432004 |
6 | 253153333114 |
7 | 35205536650 |
oct | 7720741106 |
9 | 2658188251 |
10 | 1061405254 |
11 | 4a5154528 |
12 | 25756719a |
13 | 13bb89960 |
14 | a0d736d0 |
15 | 632b06a4 |
hex | 3f43c246 |
1061405254 has 32 divisors (see below), whose sum is σ = 1986384960. Its totient is φ = 414139392.
The previous prime is 1061405239. The next prime is 1061405269. The reversal of 1061405254 is 4525041601.
1061405254 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (1061405239) and next prime (1061405269).
It is a super-2 number, since 2×10614052542 = 2253162226437609032, which 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 15 ways as a sum of consecutive naturals, for example, 26659 + ... + 53230.
It is an arithmetic number, because the mean of its divisors is an integer number (62074530).
Almost surely, 21061405254 is an apocalyptic number.
1061405254 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
1061405254 is a deficient number, since it is larger than the sum of its proper divisors (924979706).
1061405254 is a wasteful number, since it uses less digits than its factorization.
1061405254 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79984.
The product of its (nonzero) digits is 4800, while the sum is 28.
The square root of 1061405254 is about 32579.2150611398. The cubic root of 1061405254 is about 1020.0631942136.
Adding to 1061405254 its reverse (4525041601), we get a palindrome (5586446855).
The spelling of 1061405254 in words is "one billion, sixty-one million, four hundred five thousand, two hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •