Base | Representation |
---|---|
bin | 11001001100010110… |
… | …10011111101001101 |
3 | 1021220121102120201101 |
4 | 30212023103331031 |
5 | 210200000321141 |
6 | 10114040143101 |
7 | 656113005130 |
oct | 144613237515 |
9 | 37817376641 |
10 | 13525401421 |
11 | 5810811304 |
12 | 2755767a91 |
13 | 13771ab90c |
14 | 924454217 |
15 | 542636531 |
hex | 3262d3f4d |
13525401421 has 8 divisors (see below), whose sum is σ = 15688312640. Its totient is φ = 11420167968.
The previous prime is 13525401419. The next prime is 13525401443. The reversal of 13525401421 is 12410452531.
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 13525401421 - 21 = 13525401419 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13525401421.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13525401451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14418936 + ... + 14419873.
It is an arithmetic number, because the mean of its divisors is an integer number (1961039080).
Almost surely, 213525401421 is an apocalyptic number.
It is an amenable number.
13525401421 is a deficient number, since it is larger than the sum of its proper divisors (2162911219).
13525401421 is an equidigital number, since it uses as much as digits as its factorization.
13525401421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28838883.
The product of its (nonzero) digits is 4800, while the sum is 28.
Adding to 13525401421 its reverse (12410452531), we get a palindrome (25935853952).
The spelling of 13525401421 in words is "thirteen billion, five hundred twenty-five million, four hundred one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.205 sec. • engine limits •