Base | Representation |
---|---|
bin | 111001000000101000000011… |
… | …0101010010000011111000010 |
3 | 2102202112102110111211000000010 |
4 | 1302001100012222100133002 |
5 | 1011211433331204241032 |
6 | 4534305022121205350 |
7 | 210424346244266604 |
oct | 16201200652203702 |
9 | 2382472414730003 |
10 | 501463313352642 |
11 | 1358664402a1a93 |
12 | 482aab49030856 |
13 | 186a6a31303924 |
14 | 8bb8d4d5ad174 |
15 | 3ce93290eeccc |
hex | 1c81406a907c2 |
501463313352642 has 8 divisors (see below), whose sum is σ = 1002926626705296. Its totient is φ = 167154437784212.
The previous prime is 501463313352629. The next prime is 501463313352653. The reversal of 501463313352642 is 246253313364105.
It is a sphenic number, since it is the product of 3 distinct primes.
501463313352642 is an admirable number.
It is a super-2 number, since 2×5014633133526422 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 501463313352591 and 501463313352600.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 41788609446048 + ... + 41788609446059.
It is an arithmetic number, because the mean of its divisors is an integer number (125365828338162).
Almost surely, 2501463313352642 is an apocalyptic number.
501463313352642 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
501463313352642 is a wasteful number, since it uses less digits than its factorization.
501463313352642 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 83577218892112.
The product of its (nonzero) digits is 4665600, while the sum is 48.
The spelling of 501463313352642 in words is "five hundred one trillion, four hundred sixty-three billion, three hundred thirteen million, three hundred fifty-two thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •