Base | Representation |
---|---|
bin | 1110101101010001101111… |
… | …11111111010101110111001 |
3 | 11020111212110121020120222020 |
4 | 13112220313333322232321 |
5 | 13214343001032211101 |
6 | 152441421325545053 |
7 | 6545430660440505 |
oct | 726506777725671 |
9 | 136455417216866 |
10 | 32342043241401 |
11 | a33a202288733 |
12 | 3764130a15189 |
13 | 1507ac2c8bb4a |
14 | 7db512a5d305 |
15 | 3b1456502136 |
hex | 1d6a37ffabb9 |
32342043241401 has 16 divisors (see below), whose sum is σ = 46499471672640. Its totient is φ = 19928344999680.
The previous prime is 32342043241379. The next prime is 32342043241451. The reversal of 32342043241401 is 10414234024323.
It is not a de Polignac number, because 32342043241401 - 211 = 32342043239353 is a prime.
It is a super-2 number, since 2×323420432414012 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (32342043241451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6919561900 + ... + 6919566573.
It is an arithmetic number, because the mean of its divisors is an integer number (2906216979540).
Almost surely, 232342043241401 is an apocalyptic number.
It is an amenable number.
32342043241401 is a deficient number, since it is larger than the sum of its proper divisors (14157428431239).
32342043241401 is a wasteful number, since it uses less digits than its factorization.
32342043241401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13839128536.
The product of its (nonzero) digits is 55296, while the sum is 33.
Adding to 32342043241401 its reverse (10414234024323), we get a palindrome (42756277265724).
The spelling of 32342043241401 in words is "thirty-two trillion, three hundred forty-two billion, forty-three million, two hundred forty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •