Base | Representation |
---|---|
bin | 10010101111000111001101… |
… | …11101100110111110000000 |
3 | 12101212210111112221002011212 |
4 | 21113203212331212332000 |
5 | 20400020030002311222 |
6 | 223343323123025252 |
7 | 11451455113640300 |
oct | 1127434675467600 |
9 | 171783445832155 |
10 | 41201201213312 |
11 | 12145370a76538 |
12 | 475509ab0b228 |
13 | 19cb3449acc7a |
14 | a2621236b600 |
15 | 4b6b100d26e2 |
hex | 2578e6f66f80 |
41201201213312 has 96 divisors (see below), whose sum is σ = 95501376563040. Its totient is φ = 17653966848000.
The previous prime is 41201201213261. The next prime is 41201201213321. The reversal of 41201201213312 is 21331210210214.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 29427737 + ... + 30796007.
It is an arithmetic number, because the mean of its divisors is an integer number (994806005865).
Almost surely, 241201201213312 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 41201201213312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (47750688281520).
41201201213312 is an abundant number, since it is smaller than the sum of its proper divisors (54300175349728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41201201213312 is a wasteful number, since it uses less digits than its factorization.
41201201213312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1373100 (or 1373081 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 41201201213312 its reverse (21331210210214), we get a palindrome (62532411423526).
The spelling of 41201201213312 in words is "forty-one trillion, two hundred one billion, two hundred one million, two hundred thirteen thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •