Base | Representation |
---|---|
bin | 1011101101010110000… |
… | …01011001110100000101 |
3 | 1102110102001201222120012 |
4 | 11312223001121310011 |
5 | 23042403103332331 |
6 | 504451543320005 |
7 | 41031254015243 |
oct | 5665301316405 |
9 | 1373361658505 |
10 | 402301230341 |
11 | 14568461385a |
12 | 65b75a50005 |
13 | 2bc243244ba |
14 | 15685a71793 |
15 | a6e895e82b |
hex | 5dab059d05 |
402301230341 has 4 divisors (see below), whose sum is σ = 402710489952. Its totient is φ = 401891970732.
The previous prime is 402301230337. The next prime is 402301230367. The reversal of 402301230341 is 143032103204.
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 402301230341 - 22 = 402301230337 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (402301230391) 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 3 ways as a sum of consecutive naturals, for example, 204628331 + ... + 204630296.
It is an arithmetic number, because the mean of its divisors is an integer number (100677622488).
Almost surely, 2402301230341 is an apocalyptic number.
It is an amenable number.
402301230341 is a deficient number, since it is larger than the sum of its proper divisors (409259611).
402301230341 is an equidigital number, since it uses as much as digits as its factorization.
402301230341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 409259610.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 402301230341 its reverse (143032103204), we get a palindrome (545333333545).
The spelling of 402301230341 in words is "four hundred two billion, three hundred one million, two hundred thirty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •