Base | Representation |
---|---|
bin | 100111111011010000… |
… | …000100001000000001 |
3 | 11002122200110112201201 |
4 | 213323100010020001 |
5 | 1200244204414311 |
6 | 31405540501201 |
7 | 3045233654101 |
oct | 477320041001 |
9 | 132580415651 |
10 | 42869998081 |
11 | 171a9aa6089 |
12 | 83850aa801 |
13 | 407284a491 |
14 | 2109813201 |
15 | 11ad94b9c1 |
hex | 9fb404201 |
42869998081 has 8 divisors (see below), whose sum is σ = 45429832584. Its totient is φ = 40314393600.
The previous prime is 42869998027. The next prime is 42869998099. The reversal of 42869998081 is 18089996824.
It can be written as a sum of positive squares in 4 ways, for example, as 8990073856 + 33879924225 = 94816^2 + 184065^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 42869998081 - 213 = 42869989889 is a prime.
It is a super-2 number, since 2×428699980812 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (42869998001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1036620 + ... + 1077181.
It is an arithmetic number, because the mean of its divisors is an integer number (5678729073).
Almost surely, 242869998081 is an apocalyptic number.
It is an amenable number.
42869998081 is a deficient number, since it is larger than the sum of its proper divisors (2559834503).
42869998081 is a wasteful number, since it uses less digits than its factorization.
42869998081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2115011.
The product of its (nonzero) digits is 17915904, while the sum is 64.
The spelling of 42869998081 in words is "forty-two billion, eight hundred sixty-nine million, nine hundred ninety-eight thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •