Base | Representation |
---|---|
bin | 101101101110010100011… |
… | …010101000110110110000 |
3 | 102010101100010101101001100 |
4 | 231232110122220312300 |
5 | 402440020420320212 |
6 | 10403244345404400 |
7 | 443003304466566 |
oct | 55562432506660 |
9 | 12111303341040 |
10 | 3142111104432 |
11 | 100161a892923 |
12 | 428b66799700 |
13 | 19a3b889a201 |
14 | ac116a61a36 |
15 | 56b00972bdc |
hex | 2db946a8db0 |
3142111104432 has 30 divisors (see below), whose sum is σ = 8793547049612. Its totient is φ = 1047370368096.
The previous prime is 3142111104427. The next prime is 3142111104551. The reversal of 3142111104432 is 2344011112413.
It is a happy number.
3142111104432 is a `hidden beast` number, since 3 + 1 + 4 + 211 + 1 + 1 + 0 + 443 + 2 = 666.
3142111104432 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 3142111104396 and 3142111104405.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 10910107858 + ... + 10910108145.
Almost surely, 23142111104432 is an apocalyptic number.
It is an amenable number.
3142111104432 is an abundant number, since it is smaller than the sum of its proper divisors (5651435945180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3142111104432 is a wasteful number, since it uses less digits than its factorization.
3142111104432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21820216017 (or 21820216008 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 27.
Adding to 3142111104432 its reverse (2344011112413), we get a palindrome (5486122216845).
The spelling of 3142111104432 in words is "three trillion, one hundred forty-two billion, one hundred eleven million, one hundred four thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •