Base | Representation |
---|---|
bin | 11000111101110010… |
… | …10111111000100001 |
3 | 1021121002121001222211 |
4 | 30132321113320201 |
5 | 204422213232101 |
6 | 10053554202121 |
7 | 653100550051 |
oct | 143671277041 |
9 | 37532531884 |
10 | 13403258401 |
11 | 5758876465 |
12 | 2720883341 |
13 | 1357ab4440 |
14 | 91213b561 |
15 | 536a5ac51 |
hex | 31ee57e21 |
13403258401 has 16 divisors (see below), whose sum is σ = 14628978000. Its totient is φ = 12205974528.
The previous prime is 13403258359. The next prime is 13403258443. The reversal of 13403258401 is 10485230431.
It is an interprime number because it is at equal distance from previous prime (13403258359) and next prime (13403258443).
It can be written as a sum of positive squares in 8 ways, for example, as 634032400 + 12769226001 = 25180^2 + 113001^2 .
It is a cyclic number.
It is not a de Polignac number, because 13403258401 - 27 = 13403258273 is a prime.
It is not an unprimeable number, because it can be changed into a prime (13403258471) 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 15 ways as a sum of consecutive naturals, for example, 516075 + ... + 541423.
It is an arithmetic number, because the mean of its divisors is an integer number (914311125).
Almost surely, 213403258401 is an apocalyptic number.
It is an amenable number.
13403258401 is a deficient number, since it is larger than the sum of its proper divisors (1225719599).
13403258401 is a wasteful number, since it uses less digits than its factorization.
13403258401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25908.
The product of its (nonzero) digits is 11520, while the sum is 31.
Adding to 13403258401 its reverse (10485230431), we get a palindrome (23888488832).
The spelling of 13403258401 in words is "thirteen billion, four hundred three million, two hundred fifty-eight thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •