Base | Representation |
---|---|
bin | 1100101100001010011101… |
… | …1111001111010000000001 |
3 | 1211101212210001202221021001 |
4 | 3023002213133033100001 |
5 | 3312100431110331114 |
6 | 45401505045532001 |
7 | 2640026654054326 |
oct | 313024737172001 |
9 | 54355701687231 |
10 | 13952863761409 |
11 | 449a41592aa01 |
12 | 16941a9a14001 |
13 | 7a29985a7501 |
14 | 3634721dcb4d |
15 | 192e2cb8a374 |
hex | cb0a77cf401 |
13952863761409 has 4 divisors (see below), whose sum is σ = 13957145097520. Its totient is φ = 13948582425300.
The previous prime is 13952863761367. The next prime is 13952863761427. The reversal of 13952863761409 is 90416736825931.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 13952863761409 - 215 = 13952863728641 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13952863761449) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2140663167 + ... + 2140669684.
It is an arithmetic number, because the mean of its divisors is an integer number (3489286274380).
It is a 1-persistent number, because it is pandigital, but 2⋅13952863761409 = 27905727522818 is not.
Almost surely, 213952863761409 is an apocalyptic number.
It is an amenable number.
13952863761409 is a deficient number, since it is larger than the sum of its proper divisors (4281336111).
13952863761409 is an equidigital number, since it uses as much as digits as its factorization.
13952863761409 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4281336110.
The product of its (nonzero) digits is 58786560, while the sum is 64.
The spelling of 13952863761409 in words is "thirteen trillion, nine hundred fifty-two billion, eight hundred sixty-three million, seven hundred sixty-one thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •