Base | Representation |
---|---|
bin | 11101011011111011001… |
… | …10110010110001100000 |
3 | 10120200122220220001210201 |
4 | 32231331212302301200 |
5 | 113032344201323000 |
6 | 2052350404034544 |
7 | 133034021361502 |
oct | 16557546626140 |
9 | 3520586801721 |
10 | 1011424636000 |
11 | 35aa40926029 |
12 | 144030092a54 |
13 | 744b917c09c |
14 | 36d4b891d72 |
15 | 1b49973396a |
hex | eb7d9b2c60 |
1011424636000 has 96 divisors (see below), whose sum is σ = 2519113117248. Its totient is φ = 399027686400.
The previous prime is 1011424635953. The next prime is 1011424636003. The reversal of 1011424636000 is 6364241101.
It is a self number, because there is not a number n which added to its sum of digits gives 1011424636000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011424636003) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1439892 + ... + 2023891.
It is an arithmetic number, because the mean of its divisors is an integer number (26240761638).
Almost surely, 21011424636000 is an apocalyptic number.
1011424636000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1011424636000 is an abundant number, since it is smaller than the sum of its proper divisors (1507688481248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1011424636000 is an equidigital number, since it uses as much as digits as its factorization.
1011424636000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3463881 (or 3463863 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 28.
Adding to 1011424636000 its reverse (6364241101), we get a palindrome (1017788877101).
The spelling of 1011424636000 in words is "one trillion, eleven billion, four hundred twenty-four million, six hundred thirty-six thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •