Base | Representation |
---|---|
bin | 110001000110101110… |
… | …0001110110000010110 |
3 | 101002012010220221202021 |
4 | 1202031130032300112 |
5 | 3211431230444110 |
6 | 120235530403354 |
7 | 10422126636106 |
oct | 1421534166026 |
9 | 332163827667 |
10 | 105452203030 |
11 | 407a4023a19 |
12 | 1852b89055a |
13 | 9c37259995 |
14 | 51651d5206 |
15 | 2b22c172da |
hex | 188d70ec16 |
105452203030 has 16 divisors (see below), whose sum is σ = 189817967664. Its totient is φ = 42179991840.
The previous prime is 105452203007. The next prime is 105452203037. The reversal of 105452203030 is 30302254501.
It is a super-2 number, since 2×1054522030302 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105452202986 and 105452203004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105452203037) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 608929 + ... + 762691.
It is an arithmetic number, because the mean of its divisors is an integer number (11863622979).
Almost surely, 2105452203030 is an apocalyptic number.
105452203030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
105452203030 is a deficient number, since it is larger than the sum of its proper divisors (84365764634).
105452203030 is a wasteful number, since it uses less digits than its factorization.
105452203030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 222351.
The product of its (nonzero) digits is 3600, while the sum is 25.
Adding to 105452203030 its reverse (30302254501), we get a palindrome (135754457531).
The spelling of 105452203030 in words is "one hundred five billion, four hundred fifty-two million, two hundred three thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •