Base | Representation |
---|---|
bin | 101010001011010100001… |
… | …000111110101110011100 |
3 | 101021002012012000001221201 |
4 | 222023110020332232130 |
5 | 334441323433100442 |
6 | 10055254053205244 |
7 | 416254144462630 |
oct | 52132410765634 |
9 | 11232165001851 |
10 | 2898367081372 |
11 | a18210725754 |
12 | 3a9881330824 |
13 | 180412930129 |
14 | a03d3052dc0 |
15 | 505d6ea67b7 |
hex | 2a2d423eb9c |
2898367081372 has 48 divisors (see below), whose sum is σ = 5830317480960. Its totient is φ = 1234963755072.
The previous prime is 2898367081367. The next prime is 2898367081373. The reversal of 2898367081372 is 2731807638982.
2898367081372 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Smith number, since the sum of its digits (64) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2898367081373) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 25388973 + ... + 25502875.
It is an arithmetic number, because the mean of its divisors is an integer number (121464947520).
Almost surely, 22898367081372 is an apocalyptic number.
It is an amenable number.
2898367081372 is an abundant number, since it is smaller than the sum of its proper divisors (2931950399588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2898367081372 is a wasteful number, since it uses less digits than its factorization.
2898367081372 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119170 (or 119168 counting only the distinct ones).
The product of its (nonzero) digits is 48771072, while the sum is 64.
The spelling of 2898367081372 in words is "two trillion, eight hundred ninety-eight billion, three hundred sixty-seven million, eighty-one thousand, three hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •