Base | Representation |
---|---|
bin | 110001001001011010… |
… | …0011111111101000010 |
3 | 101002102102202000201001 |
4 | 1202102310133331002 |
5 | 3212122331413020 |
6 | 120252513002214 |
7 | 10424304013543 |
oct | 1422264377502 |
9 | 332372660631 |
10 | 105542451010 |
11 | 4083aa64627 |
12 | 18555b5336a |
13 | 9c4cb67759 |
14 | 51731a84ca |
15 | 2b2aae250a |
hex | 1892d1ff42 |
105542451010 has 16 divisors (see below), whose sum is σ = 190388516472. Its totient is φ = 42125401600.
The previous prime is 105542450999. The next prime is 105542451013. The reversal of 105542451010 is 10154245501.
It can be written as a sum of positive squares in 4 ways, for example, as 80657704009 + 24884747001 = 284003^2 + 157749^2 .
It is a super-2 number, since 2×1055424510102 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 105542451010.
It is not an unprimeable number, because it can be changed into a prime (105542451013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11442511 + ... + 11451730.
Almost surely, 2105542451010 is an apocalyptic number.
105542451010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
105542451010 is a deficient number, since it is larger than the sum of its proper divisors (84846065462).
105542451010 is a wasteful number, since it uses less digits than its factorization.
105542451010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22894709.
The product of its (nonzero) digits is 4000, while the sum is 28.
Adding to 105542451010 its reverse (10154245501), we get a palindrome (115696696511).
The spelling of 105542451010 in words is "one hundred five billion, five hundred forty-two million, four hundred fifty-one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •