Base | Representation |
---|---|
bin | 10001100000010100110… |
… | …10000111111001000000 |
3 | 2010111111110222220112210 |
4 | 20300022122013321000 |
5 | 34323302312313124 |
6 | 1140151142222120 |
7 | 61311662666532 |
oct | 10601232077100 |
9 | 2114443886483 |
10 | 601470041664 |
11 | 21209a181668 |
12 | 9869b124940 |
13 | 4494539074b |
14 | 2117b5c9852 |
15 | 109a3e4aa29 |
hex | 8c0a687e40 |
601470041664 has 112 divisors (see below), whose sum is σ = 1654093199808. Its totient is φ = 192720918528.
The previous prime is 601470041633. The next prime is 601470041681. The reversal of 601470041664 is 466140074106.
It is a super-2 number, since 2×6014700416642 (a number of 24 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 79594 + ... + 1099670.
It is an arithmetic number, because the mean of its divisors is an integer number (14768689284).
Almost surely, 2601470041664 is an apocalyptic number.
601470041664 is a gapful number since it is divisible by the number (64) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 601470041664, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (827046599904).
601470041664 is an abundant number, since it is smaller than the sum of its proper divisors (1052623158144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
601470041664 is a wasteful number, since it uses less digits than its factorization.
601470041664 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1020212 (or 1020202 counting only the distinct ones).
The product of its (nonzero) digits is 96768, while the sum is 39.
The spelling of 601470041664 in words is "six hundred one billion, four hundred seventy million, forty-one thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •