Base | Representation |
---|---|
bin | 1011110010000000001… |
… | …0101100011111000001 |
3 | 201100102200021011121201 |
4 | 2330200002230133001 |
5 | 11304004131242241 |
6 | 232552020421201 |
7 | 20423454312364 |
oct | 2744002543701 |
9 | 640380234551 |
10 | 202401040321 |
11 | 78924124347 |
12 | 33287847801 |
13 | 161178b04ac |
14 | 9b20d320db |
15 | 53e9153931 |
hex | 2f200ac7c1 |
202401040321 has 4 divisors (see below), whose sum is σ = 202404023172. Its totient is φ = 202398057472.
The previous prime is 202401040253. The next prime is 202401040421. The reversal of 202401040321 is 123040104202.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 150524600625 + 51876439696 = 387975^2 + 227764^2 .
It is a cyclic number.
It is not a de Polignac number, because 202401040321 - 213 = 202401032129 is a prime.
It is a super-2 number, since 2×2024010403212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (202401040421) 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, 1387216 + ... + 1526161.
It is an arithmetic number, because the mean of its divisors is an integer number (50601005793).
Almost surely, 2202401040321 is an apocalyptic number.
It is an amenable number.
202401040321 is a deficient number, since it is larger than the sum of its proper divisors (2982851).
202401040321 is an equidigital number, since it uses as much as digits as its factorization.
202401040321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2982850.
The product of its (nonzero) digits is 384, while the sum is 19.
Adding to 202401040321 its reverse (123040104202), we get a palindrome (325441144523).
The spelling of 202401040321 in words is "two hundred two billion, four hundred one million, forty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •