Base | Representation |
---|---|
bin | 1111011001101101… |
… | …0100100000110110 |
3 | 101200010112002200001 |
4 | 3312123110200312 |
5 | 31431343411141 |
6 | 1522125341514 |
7 | 204311312041 |
oct | 36633244066 |
9 | 11603462601 |
10 | 4134357046 |
11 | 1831811706 |
12 | 97470789a |
13 | 50b704421 |
14 | 2b3129c58 |
15 | 192e64a31 |
hex | f66d4836 |
4134357046 has 8 divisors (see below), whose sum is σ = 6203968560. Its totient is φ = 2066367528.
The previous prime is 4134357011. The next prime is 4134357047. The reversal of 4134357046 is 6407534314.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×41343570462 = 34185816367619692232, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4134356996 and 4134357014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4134357047) 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 3 ways as a sum of consecutive naturals, for example, 399106 + ... + 409333.
It is an arithmetic number, because the mean of its divisors is an integer number (775496070).
Almost surely, 24134357046 is an apocalyptic number.
4134357046 is a deficient number, since it is larger than the sum of its proper divisors (2069611514).
4134357046 is a wasteful number, since it uses less digits than its factorization.
4134357046 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 810998.
The product of its (nonzero) digits is 120960, while the sum is 37.
The square root of 4134357046 is about 64298.9661347677. The cubic root of 4134357046 is about 1604.9788975723.
It can be divided in two parts, 41343 and 57046, that added together give a palindrome (98389).
The spelling of 4134357046 in words is "four billion, one hundred thirty-four million, three hundred fifty-seven thousand, forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •