Base | Representation |
---|---|
bin | 100111100100010101010… |
… | …000000000000010000101 |
3 | 100121221101201102222212002 |
4 | 213210111100000002011 |
5 | 324022124112024331 |
6 | 5441042432035045 |
7 | 400306052402300 |
oct | 47442520000205 |
9 | 10557351388762 |
10 | 2719070814341 |
11 | 959173652572 |
12 | 37ab83392a85 |
13 | 16953aa3412b |
14 | 958648c3b37 |
15 | 4aae145b9cb |
hex | 27915400085 |
2719070814341 has 12 divisors (see below), whose sum is σ = 3163701244428. Its totient is φ = 2330115967872.
The previous prime is 2719070814331. The next prime is 2719070814373. The reversal of 2719070814341 is 1434180709172.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 964479162241 + 1754591652100 = 982079^2 + 1324610^2 .
It is not a de Polignac number, because 2719070814341 - 218 = 2719070552197 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2719070814331) 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 11 ways as a sum of consecutive naturals, for example, 5921156 + ... + 6363821.
It is an arithmetic number, because the mean of its divisors is an integer number (263641770369).
Almost surely, 22719070814341 is an apocalyptic number.
It is an amenable number.
2719070814341 is a deficient number, since it is larger than the sum of its proper divisors (444630430087).
2719070814341 is a wasteful number, since it uses less digits than its factorization.
2719070814341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12289508 (or 12289501 counting only the distinct ones).
The product of its (nonzero) digits is 338688, while the sum is 47.
The spelling of 2719070814341 in words is "two trillion, seven hundred nineteen billion, seventy million, eight hundred fourteen thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •