Base | Representation |
---|---|
bin | 1111001001010110… |
… | …0100111001010110 |
3 | 101111100102010002200 |
4 | 3302111210321112 |
5 | 31311312224142 |
6 | 1511234545330 |
7 | 202516145310 |
oct | 36225447126 |
9 | 11440363080 |
10 | 4065742422 |
11 | 17a7007505 |
12 | 955738246 |
13 | 4ca42c361 |
14 | 2a7d887b0 |
15 | 18be0e64c |
hex | f2564e56 |
4065742422 has 48 divisors (see below), whose sum is σ = 10102004640. Its totient is φ = 1157665536.
The previous prime is 4065742403. The next prime is 4065742433. The reversal of 4065742422 is 2242475604.
4065742422 is a `hidden beast` number, since 40 + 6 + 574 + 2 + 42 + 2 = 666.
It is a super-2 number, since 2×40657424222 = 33060522884100852168, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 18147 + ... + 91982.
It is an arithmetic number, because the mean of its divisors is an integer number (210458430).
Almost surely, 24065742422 is an apocalyptic number.
4065742422 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
4065742422 is an abundant number, since it is smaller than the sum of its proper divisors (6036262218).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4065742422 is a wasteful number, since it uses less digits than its factorization.
4065742422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110437 (or 110434 counting only the distinct ones).
The product of its (nonzero) digits is 107520, while the sum is 36.
The square root of 4065742422 is about 63763.1744975107. The cubic root of 4065742422 is about 1596.0504699777.
The spelling of 4065742422 in words is "four billion, sixty-five million, seven hundred forty-two thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •