Base | Representation |
---|---|
bin | 111010011101000110110… |
… | …011010010100110001001 |
3 | 112020000112101211112010202 |
4 | 322131012303102212021 |
5 | 1011303234430204033 |
6 | 12313213131021545 |
7 | 563134364641256 |
oct | 72350663224611 |
9 | 15200471745122 |
10 | 4016982272393 |
11 | 1309657852232 |
12 | 54a62729a8b5 |
13 | 231a52222b1c |
14 | dc5cc92642d |
15 | 6e756d2e8e8 |
hex | 3a746cd2989 |
4016982272393 has 8 divisors (see below), whose sum is σ = 4148151759360. Its totient is φ = 3885912123840.
The previous prime is 4016982272389. The next prime is 4016982272411. The reversal of 4016982272393 is 3932722896104.
4016982272393 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4016982272393 - 22 = 4016982272389 is a prime.
It is a super-2 number, since 2×40169822723932 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4016984272393) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 24752405 + ... + 24914162.
It is an arithmetic number, because the mean of its divisors is an integer number (518518969920).
Almost surely, 24016982272393 is an apocalyptic number.
It is an amenable number.
4016982272393 is a deficient number, since it is larger than the sum of its proper divisors (131169486967).
4016982272393 is a wasteful number, since it uses less digits than its factorization.
4016982272393 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49669207.
The product of its (nonzero) digits is 7838208, while the sum is 56.
The spelling of 4016982272393 in words is "four trillion, sixteen billion, nine hundred eighty-two million, two hundred seventy-two thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •