Base | Representation |
---|---|
bin | 1111011001101000… |
… | …0000000010001110 |
3 | 101200002212112000100 |
4 | 3312122000002032 |
5 | 31431301323042 |
6 | 1522114111530 |
7 | 204305341161 |
oct | 36632000216 |
9 | 11602775010 |
10 | 4134011022 |
11 | 18315a5739 |
12 | 97457b5a6 |
13 | 50b612a8b |
14 | 2b3079ad8 |
15 | 192de724c |
hex | f668008e |
4134011022 has 48 divisors (see below), whose sum is σ = 9018530352. Its totient is φ = 1368576000.
The previous prime is 4134010981. The next prime is 4134011027. The reversal of 4134011022 is 2201104314.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 4134010986 and 4134011004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4134011027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1835397 + ... + 1837647.
It is an arithmetic number, because the mean of its divisors is an integer number (187886049).
Almost surely, 24134011022 is an apocalyptic number.
4134011022 is an abundant number, since it is smaller than the sum of its proper divisors (4884519330).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4134011022 is a wasteful number, since it uses less digits than its factorization.
4134011022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2913 (or 2910 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
The square root of 4134011022 is about 64296.2753353567. The cubic root of 4134011022 is about 1604.9341202178.
Adding to 4134011022 its reverse (2201104314), we get a palindrome (6335115336).
The spelling of 4134011022 in words is "four billion, one hundred thirty-four million, eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •