Base | Representation |
---|---|
bin | 1111010010110011… |
… | …0111001111010100 |
3 | 101121010000222212000 |
4 | 3310230313033110 |
5 | 31401440320200 |
6 | 1515212555300 |
7 | 203510223000 |
oct | 36454671724 |
9 | 11533028760 |
10 | 4105401300 |
11 | 1817434840 |
12 | 966a82b30 |
13 | 505706850 |
14 | 2ad34d700 |
15 | 190645300 |
hex | f4b373d4 |
4105401300 has 1152 divisors, whose sum is σ = 18665472000. Its totient is φ = 762048000.
The previous prime is 4105401277. The next prime is 4105401317. The reversal of 4105401300 is 31045014.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
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 383 ways as a sum of consecutive naturals, for example, 132432285 + ... + 132432315.
Almost surely, 24105401300 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4105401300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9332736000).
4105401300 is an abundant number, since it is smaller than the sum of its proper divisors (14560070700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4105401300 is a wasteful number, since it uses less digits than its factorization.
4105401300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99 (or 72 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 18.
The square root of 4105401300 is about 64073.4055595611. The cubic root of 4105401300 is about 1601.2231922413.
Adding to 4105401300 its reverse (31045014), we get a palindrome (4136446314).
The spelling of 4105401300 in words is "four billion, one hundred five million, four hundred one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •