Base | Representation |
---|---|
bin | 1011111100001010000… |
… | …10111101110001000010 |
3 | 1110012221022100120122220 |
4 | 11332011002331301002 |
5 | 23210200013241010 |
6 | 512245035511510 |
7 | 41432322542514 |
oct | 5760502756102 |
9 | 1405838316586 |
10 | 410254040130 |
11 | 148a9578a530 |
12 | 676152b8596 |
13 | 2c8c0b540cc |
14 | 15bdbd73bb4 |
15 | aa11c37970 |
hex | 5f850bdc42 |
410254040130 has 128 divisors (see below), whose sum is σ = 1083022617600. Its totient is φ = 98632185600.
The previous prime is 410254040101. The next prime is 410254040153. The reversal of 410254040130 is 31040452014.
It is a self number, because there is not a number n which added to its sum of digits gives 410254040130.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 127051356 + ... + 127054584.
It is an arithmetic number, because the mean of its divisors is an integer number (8461114200).
Almost surely, 2410254040130 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 410254040130, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (541511308800).
410254040130 is an abundant number, since it is smaller than the sum of its proper divisors (672768577470).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
410254040130 is a wasteful number, since it uses less digits than its factorization.
410254040130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6320.
The product of its (nonzero) digits is 1920, while the sum is 24.
Adding to 410254040130 its reverse (31040452014), we get a palindrome (441294492144).
The spelling of 410254040130 in words is "four hundred ten billion, two hundred fifty-four million, forty thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •