Base | Representation |
---|---|
bin | 111110110111000… |
… | …110000001010010 |
3 | 2201111110202100021 |
4 | 332313012001102 |
5 | 4124441124340 |
6 | 252352214054 |
7 | 35064130642 |
oct | 7667060122 |
9 | 2644422307 |
10 | 1054629970 |
11 | 4a1347119 |
12 | 25523a32a |
13 | 13a656b04 |
14 | a00cc522 |
15 | 628c2e4a |
hex | 3edc6052 |
1054629970 has 8 divisors (see below), whose sum is σ = 1898333964. Its totient is φ = 421851984.
The previous prime is 1054629929. The next prime is 1054629977. The reversal of 1054629970 is 799264501.
It is a happy number.
1054629970 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 946116081 + 108513889 = 30759^2 + 10417^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×10546299702 = 2224488747244401800, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1054629977) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 52731489 + ... + 52731508.
Almost surely, 21054629970 is an apocalyptic number.
1054629970 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1054629970 is a deficient number, since it is larger than the sum of its proper divisors (843703994).
1054629970 is a wasteful number, since it uses less digits than its factorization.
1054629970 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105463004.
The product of its (nonzero) digits is 136080, while the sum is 43.
The square root of 1054629970 is about 32475.0668975446. The cubic root of 1054629970 is about 1017.8880979819. Note that the first 3 decimals are identical.
The spelling of 1054629970 in words is "one billion, fifty-four million, six hundred twenty-nine thousand, nine hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •