Base | Representation |
---|---|
bin | 100111111101111… |
… | …1001011000100000 |
3 | 10110110112000112122 |
4 | 1033323321120200 |
5 | 10221310222400 |
6 | 341024243412 |
7 | 45143114126 |
oct | 11773713040 |
9 | 3413460478 |
10 | 1341101600 |
11 | 629020533 |
12 | 315170568 |
13 | 184ac9057 |
14 | ca17d916 |
15 | 7cb0d685 |
hex | 4fef9620 |
1341101600 has 72 divisors (see below), whose sum is σ = 3280290048. Its totient is φ = 535404800.
The previous prime is 1341101599. The next prime is 1341101621. The reversal of 1341101600 is 61011431.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 516305 + ... + 518895.
It is an arithmetic number, because the mean of its divisors is an integer number (45559584).
Almost surely, 21341101600 is an apocalyptic number.
1341101600 is a gapful number since it is divisible by the number (10) 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 1341101600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1640145024).
1341101600 is an abundant number, since it is smaller than the sum of its proper divisors (1939188448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1341101600 is a wasteful number, since it uses less digits than its factorization.
1341101600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3258 (or 3245 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 17.
The square root of 1341101600 is about 36621.0540536452. The cubic root of 1341101600 is about 1102.7757994232.
The spelling of 1341101600 in words is "one billion, three hundred forty-one million, one hundred one thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •