Base | Representation |
---|---|
bin | 10010101111011111001000… |
… | …10110111011110000110010 |
3 | 12101221000122110221002100120 |
4 | 21113233210112323300302 |
5 | 20400222324330003242 |
6 | 223353245242431110 |
7 | 11452421251262400 |
oct | 1127574426736062 |
9 | 171830573832316 |
10 | 41214042422322 |
11 | 1214a860554970 |
12 | 4757683502496 |
13 | 19cc6101c55b3 |
14 | a26aad9a0470 |
15 | 4b711261a1ec |
hex | 257be45bbc32 |
41214042422322 has 96 divisors (see below), whose sum is σ = 105268876015680. Its totient is φ = 10636761582720.
The previous prime is 41214042422261. The next prime is 41214042422323. The reversal of 41214042422322 is 22322424041214.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (41214042422323) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 40078197 + ... + 41093672.
It is an arithmetic number, because the mean of its divisors is an integer number (1096550791830).
Almost surely, 241214042422322 is an apocalyptic number.
41214042422322 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
41214042422322 is an abundant number, since it is smaller than the sum of its proper divisors (64054833593358).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41214042422322 is a wasteful number, since it uses less digits than its factorization.
41214042422322 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 81172056 (or 81172049 counting only the distinct ones).
The product of its (nonzero) digits is 49152, while the sum is 33.
Adding to 41214042422322 its reverse (22322424041214), we get a palindrome (63536466463536).
The spelling of 41214042422322 in words is "forty-one trillion, two hundred fourteen billion, forty-two million, four hundred twenty-two thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •