Base | Representation |
---|---|
bin | 1011111000011010100… |
… | …0011110101101011010 |
3 | 201111212121222020012011 |
4 | 2332012220132231122 |
5 | 11321020242041102 |
6 | 233434503340134 |
7 | 20514224153131 |
oct | 2760650365532 |
9 | 644777866164 |
10 | 204122221402 |
11 | 79627744150 |
12 | 3368815164a |
13 | 16330364938 |
14 | 9c4576c918 |
15 | 549a2dd2d7 |
hex | 2f86a1eb5a |
204122221402 has 8 divisors (see below), whose sum is σ = 334018180512. Its totient is φ = 92782827900.
The previous prime is 204122221379. The next prime is 204122221403.
204122221402 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (22), and also a Moran number because the ratio is a prime number: 9278282791 = 204122221402 / (2 + 0 + 4 + 1 + 2 + 2 + 2 + 2 + 1 + 4 + 0 + 2).
It is not an unprimeable number, because it can be changed into a prime (204122221403) 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, 4639141374 + ... + 4639141417.
It is an arithmetic number, because the mean of its divisors is an integer number (41752272564).
Almost surely, 2204122221402 is an apocalyptic number.
204122221402 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
204122221402 is a deficient number, since it is larger than the sum of its proper divisors (129895959110).
204122221402 is a wasteful number, since it uses less digits than its factorization.
204122221402 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9278282804.
The product of its (nonzero) digits is 1024, while the sum is 22.
It can be divided in two parts, 204122 and 221402, that added together give a palindrome (425524).
The spelling of 204122221402 in words is "two hundred four billion, one hundred twenty-two million, two hundred twenty-one thousand, four hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •