Base | Representation |
---|---|
bin | 111010010010111011110… |
… | …011100000111110000010 |
3 | 112011222100020100001222010 |
4 | 322102323303200332002 |
5 | 1011113402423114100 |
6 | 12304205252353350 |
7 | 562266624151602 |
oct | 72227363407602 |
9 | 15158306301863 |
10 | 4006060363650 |
11 | 1304a62701574 |
12 | 548499615856 |
13 | 230a0153ab27 |
14 | dbc74182c02 |
15 | 6e318068750 |
hex | 3a4bbce0f82 |
4006060363650 has 96 divisors (see below), whose sum is σ = 10371968830080. Its totient is φ = 1021344698880.
The previous prime is 4006060363649. The next prime is 4006060363687. The reversal of 4006060363650 is 563630606004.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 4006060363599 and 4006060363608.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 6929124 + ... + 7484976.
It is an arithmetic number, because the mean of its divisors is an integer number (108041341980).
Almost surely, 24006060363650 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4006060363650, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5185984415040).
4006060363650 is an abundant number, since it is smaller than the sum of its proper divisors (6365908466430).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4006060363650 is a wasteful number, since it uses less digits than its factorization.
4006060363650 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 557980 (or 557975 counting only the distinct ones).
The product of its (nonzero) digits is 233280, while the sum is 39.
Adding to 4006060363650 its reverse (563630606004), we get a palindrome (4569690969654).
The spelling of 4006060363650 in words is "four trillion, six billion, sixty million, three hundred sixty-three thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •