Base | Representation |
---|---|
bin | 10101010001000011100… |
… | …100001100011011111000 |
3 | 12011201012001011011010201 |
4 | 111101003210030123320 |
5 | 142420443121122412 |
6 | 3035211310451544 |
7 | 210404260540444 |
oct | 25210344143370 |
9 | 5151161134121 |
10 | 1461422442232 |
11 | 513870962245 |
12 | 1b7297503bb4 |
13 | a7a71c6c74c |
14 | 50a39d73824 |
15 | 280356dbe57 |
hex | 1544390c6f8 |
1461422442232 has 256 divisors, whose sum is σ = 3046450176000. Its totient is φ = 655290155520.
The previous prime is 1461422442197. The next prime is 1461422442239. The reversal of 1461422442232 is 2322442241641.
It is a super-3 number, since 3×14614224422323 (a number of 37 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1461422442191 and 1461422442200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1461422442239) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 6926172607 + ... + 6926172817.
It is an arithmetic number, because the mean of its divisors is an integer number (11900196000).
Almost surely, 21461422442232 is an apocalyptic number.
It is an amenable number.
1461422442232 is an abundant number, since it is smaller than the sum of its proper divisors (1585027733768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1461422442232 is a wasteful number, since it uses less digits than its factorization.
1461422442232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 618 (or 614 counting only the distinct ones).
The product of its digits is 147456, while the sum is 37.
Adding to 1461422442232 its reverse (2322442241641), we get a palindrome (3783864683873).
The spelling of 1461422442232 in words is "one trillion, four hundred sixty-one billion, four hundred twenty-two million, four hundred forty-two thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •