Base | Representation |
---|---|
bin | 100001111100100000100… |
… | …0101111101100000000000 |
3 | 121112000021121011122001221 |
4 | 1003321001011331200000 |
5 | 1102414243200040440 |
6 | 13531133430404424 |
7 | 661031422326316 |
oct | 103710105754000 |
9 | 17460247148057 |
10 | 4665426565120 |
11 | 1539661739992 |
12 | 634235b00714 |
13 | 27ac425249a9 |
14 | 121b44a560b6 |
15 | 81559b91d4a |
hex | 43e4117d800 |
4665426565120 has 96 divisors (see below), whose sum is σ = 11205542602800. Its totient is φ = 1864294760448.
The previous prime is 4665426565109. The next prime is 4665426565169. The reversal of 4665426565120 is 215656245664.
It is a super-2 number, since 2×46654265651202 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9980791 + ... + 10437769.
Almost surely, 24665426565120 is an apocalyptic number.
4665426565120 is a gapful number since it is divisible by the number (40) 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 4665426565120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5602771301400).
4665426565120 is an abundant number, since it is smaller than the sum of its proper divisors (6540116037680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4665426565120 is an equidigital number, since it uses as much as digits as its factorization.
4665426565120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 458003 (or 457983 counting only the distinct ones).
The product of its (nonzero) digits is 10368000, while the sum is 52.
The spelling of 4665426565120 in words is "four trillion, six hundred sixty-five billion, four hundred twenty-six million, five hundred sixty-five thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •