Base | Representation |
---|---|
bin | 111110111101000110100… |
… | …100111000100011101100 |
3 | 120022120201102220200100210 |
4 | 332331012210320203230 |
5 | 1031340042313003121 |
6 | 13111234122022420 |
7 | 624362445312516 |
oct | 76750644704354 |
9 | 16276642820323 |
10 | 4326216141036 |
11 | 1418813255729 |
12 | 59a549047a10 |
13 | 254c640b6b1a |
14 | 10d56615abb6 |
15 | 77804eb4876 |
hex | 3ef469388ec |
4326216141036 has 48 divisors (see below), whose sum is σ = 10208694988800. Its totient is φ = 1425761538432.
The previous prime is 4326216141031. The next prime is 4326216141047. The reversal of 4326216141036 is 6301416126234.
It is a super-2 number, since 2×43262161410362 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4326216140985 and 4326216141003.
It is not an unprimeable number, because it can be changed into a prime (4326216141031) by changing a digit.
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, 14702725 + ... + 14994083.
It is an arithmetic number, because the mean of its divisors is an integer number (212681145600).
Almost surely, 24326216141036 is an apocalyptic number.
It is an amenable number.
4326216141036 is an abundant number, since it is smaller than the sum of its proper divisors (5882478847764).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4326216141036 is a wasteful number, since it uses less digits than its factorization.
4326216141036 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 305358 (or 305356 counting only the distinct ones).
The product of its (nonzero) digits is 124416, while the sum is 39.
The spelling of 4326216141036 in words is "four trillion, three hundred twenty-six billion, two hundred sixteen million, one hundred forty-one thousand, thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •