Base | Representation |
---|---|
bin | 100110100000110011… |
… | …010011111011111110 |
3 | 10221201221001020010000 |
4 | 212200303103323332 |
5 | 1134142220324410 |
6 | 30555211455130 |
7 | 2662516355142 |
oct | 464063237376 |
9 | 127657036100 |
10 | 41352511230 |
11 | 165a0461818 |
12 | 8020a574a6 |
13 | 3b90344974 |
14 | 200407b222 |
15 | 11205eadc0 |
hex | 9a0cd3efe |
41352511230 has 80 divisors (see below), whose sum is σ = 111268635984. Its totient is φ = 11019767040.
The previous prime is 41352511219. The next prime is 41352511301. The reversal of 41352511230 is 3211525314.
41352511230 is a `hidden beast` number, since 4 + 13 + 525 + 1 + 123 + 0 = 666.
It is a super-2 number, since 2×413525112302 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 41352511194 and 41352511203.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 1216870 + ... + 1250390.
Almost surely, 241352511230 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 41352511230, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (55634317992).
41352511230 is an abundant number, since it is smaller than the sum of its proper divisors (69916124754).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41352511230 is a wasteful number, since it uses less digits than its factorization.
41352511230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35063 (or 35054 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
The spelling of 41352511230 in words is "forty-one billion, three hundred fifty-two million, five hundred eleven thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •