Base | Representation |
---|---|
bin | 1100101100001101000001… |
… | …0110100010111101010011 |
3 | 1211101221112211211101012121 |
4 | 3023003100112202331103 |
5 | 3312103332113124231 |
6 | 45402101100235111 |
7 | 2640052650340141 |
oct | 313032026427523 |
9 | 54357484741177 |
10 | 13953549348691 |
11 | 449a737925867 |
12 | 169435b53ba97 |
13 | 7a2a7763b664 |
14 | 3634d92a4591 |
15 | 192e6ce62311 |
hex | cb0d05a2f53 |
13953549348691 has 2 divisors, whose sum is σ = 13953549348692. Its totient is φ = 13953549348690.
The previous prime is 13953549348671. The next prime is 13953549348737. The reversal of 13953549348691 is 19684394535931.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13953549348691 - 219 = 13953548824403 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13953549348691.
It is not a weakly prime, because it can be changed into another prime (13953549348601) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6976774674345 + 6976774674346.
It is an arithmetic number, because the mean of its divisors is an integer number (6976774674346).
Almost surely, 213953549348691 is an apocalyptic number.
13953549348691 is a deficient number, since it is larger than the sum of its proper divisors (1).
13953549348691 is an equidigital number, since it uses as much as digits as its factorization.
13953549348691 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 377913600, while the sum is 70.
The spelling of 13953549348691 in words is "thirteen trillion, nine hundred fifty-three billion, five hundred forty-nine million, three hundred forty-eight thousand, six hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •