Base | Representation |
---|---|
bin | 11101111000001000000000… |
… | …000111110111000101100001 |
3 | 122020020201222001122020101111 |
4 | 131320020000013313011201 |
5 | 114210330133231430330 |
6 | 1143244233310503321 |
7 | 36451232142203014 |
oct | 3570100007670541 |
9 | 566221861566344 |
10 | 131400231514465 |
11 | 38960586102791 |
12 | 128a22b3804b41 |
13 | 5841cb112b764 |
14 | 2463b3b43137b |
15 | 102d04cbda32a |
hex | 7782001f7161 |
131400231514465 has 8 divisors (see below), whose sum is σ = 157926268894248. Its totient is φ = 104956191160320.
The previous prime is 131400231514457. The next prime is 131400231514529. The reversal of 131400231514465 is 564415132004131.
It can be written as a sum of positive squares in 4 ways, for example, as 79773692918544 + 51626538595921 = 8931612^2 + 7185161^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 131400231514465 - 23 = 131400231514457 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20499252882 + ... + 20499259291.
It is an arithmetic number, because the mean of its divisors is an integer number (19740783611781).
Almost surely, 2131400231514465 is an apocalyptic number.
It is an amenable number.
131400231514465 is a deficient number, since it is larger than the sum of its proper divisors (26526037379783).
131400231514465 is an equidigital number, since it uses as much as digits as its factorization.
131400231514465 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40998512819.
The product of its (nonzero) digits is 172800, while the sum is 40.
Adding to 131400231514465 its reverse (564415132004131), we get a palindrome (695815363518596).
The spelling of 131400231514465 in words is "one hundred thirty-one trillion, four hundred billion, two hundred thirty-one million, five hundred fourteen thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •