Base | Representation |
---|---|
bin | 11110111111110000010… |
… | …10001110111000010110 |
3 | 10202211000002200122022220 |
4 | 33133320022032320112 |
5 | 114422130202312240 |
6 | 2133132534203210 |
7 | 136642124433351 |
oct | 17377012167026 |
9 | 3684002618286 |
10 | 1065020354070 |
11 | 380744252302 |
12 | 1524a91b3506 |
13 | 7957ab5cc2a |
14 | 39793979298 |
15 | 1ca84ae15d0 |
hex | f7f828ee16 |
1065020354070 has 32 divisors (see below), whose sum is σ = 2560259847168. Its totient is φ = 283537539168.
The previous prime is 1065020353961. The next prime is 1065020354107. The reversal of 1065020354070 is 704530205601.
It is a super-4 number, since 4×10650203540704 (a number of 49 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 29224524 + ... + 29260943.
It is an arithmetic number, because the mean of its divisors is an integer number (80008120224).
Almost surely, 21065020354070 is an apocalyptic number.
1065020354070 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1065020354070 is an abundant number, since it is smaller than the sum of its proper divisors (1495239493098).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1065020354070 is a wasteful number, since it uses less digits than its factorization.
1065020354070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58486084.
The product of its (nonzero) digits is 25200, while the sum is 33.
Adding to 1065020354070 its reverse (704530205601), we get a palindrome (1769550559671).
The spelling of 1065020354070 in words is "one trillion, sixty-five billion, twenty million, three hundred fifty-four thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •