Base | Representation |
---|---|
bin | 111101101101110000000… |
… | …110010110011111010010 |
3 | 120000102210111222201110120 |
4 | 331231300012112133102 |
5 | 1023441043414344242 |
6 | 13004143352211110 |
7 | 615255160254000 |
oct | 75556006263722 |
9 | 16012714881416 |
10 | 4241013434322 |
11 | 1395670580035 |
12 | 585b2a999a96 |
13 | 249c0612c132 |
14 | 1093a2435a70 |
15 | 754b9d9d1ec |
hex | 3db701967d2 |
4241013434322 has 64 divisors (see below), whose sum is σ = 10030894848000. Its totient is φ = 1194651630480.
The previous prime is 4241013434321. The next prime is 4241013434341. The reversal of 4241013434322 is 2234343101424.
It is not an unprimeable number, because it can be changed into a prime (4241013434321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 14366172 + ... + 14658407.
It is an arithmetic number, because the mean of its divisors is an integer number (156732732000).
Almost surely, 24241013434322 is an apocalyptic number.
4241013434322 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
4241013434322 is an abundant number, since it is smaller than the sum of its proper divisors (5789881413678).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4241013434322 is a wasteful number, since it uses less digits than its factorization.
4241013434322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29024676 (or 29024662 counting only the distinct ones).
The product of its (nonzero) digits is 55296, while the sum is 33.
Adding to 4241013434322 its reverse (2234343101424), we get a palindrome (6475356535746).
The spelling of 4241013434322 in words is "four trillion, two hundred forty-one billion, thirteen million, four hundred thirty-four thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •