Base | Representation |
---|---|
bin | 1001001001000000011110000… |
… | …0100101011110000100101000 |
3 | 10010100110110100120022201200220 |
4 | 2102100013200211132010220 |
5 | 1133302023400433311034 |
6 | 10200004135240530040 |
7 | 252325165556125524 |
oct | 22220074045360450 |
9 | 3110413316281626 |
10 | 643222365135144 |
11 | 176a50089389a53 |
12 | 60184978780920 |
13 | 217ba7bb5ca612 |
14 | b4ba1b2b8cd84 |
15 | 4e56a532a9749 |
hex | 24901e095e128 |
643222365135144 has 32 divisors (see below), whose sum is σ = 1702647437123520. Its totient is φ = 201795251806976.
The previous prime is 643222365135071. The next prime is 643222365135149. The reversal of 643222365135144 is 441531563222346.
It is a super-2 number, since 2×6432223651351442 (a number of 30 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is not an unprimeable number, because it can be changed into a prime (643222365135149) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 788262701964 + ... + 788262702779.
It is an arithmetic number, because the mean of its divisors is an integer number (53207732410110).
Almost surely, 2643222365135144 is an apocalyptic number.
It is an amenable number.
643222365135144 is an abundant number, since it is smaller than the sum of its proper divisors (1059425071988376).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
643222365135144 is a wasteful number, since it uses less digits than its factorization.
643222365135144 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1576525404769 (or 1576525404765 counting only the distinct ones).
The product of its digits is 12441600, while the sum is 51.
The spelling of 643222365135144 in words is "six hundred forty-three trillion, two hundred twenty-two billion, three hundred sixty-five million, one hundred thirty-five thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •