Base | Representation |
---|---|
bin | 1011101010101000111… |
… | …0011100111110001111 |
3 | 201011022220212222222012 |
4 | 2322222032130332033 |
5 | 11240432122123043 |
6 | 232023530411435 |
7 | 20323463245634 |
oct | 2725216347617 |
9 | 634286788865 |
10 | 200424411023 |
11 | 77aaa39a511 |
12 | 32a15890b7b |
13 | 15b91229865 |
14 | 99b45dc18b |
15 | 533085aa18 |
hex | 2eaa39cf8f |
200424411023 has 8 divisors (see below), whose sum is σ = 207392156400. Its totient is φ = 193460436288.
The previous prime is 200424410999. The next prime is 200424411133. The reversal of 200424411023 is 320114424002.
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 200424411023 - 224 = 200407633807 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 200424411023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200424411623) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 834293 + ... + 1047326.
It is an arithmetic number, because the mean of its divisors is an integer number (25924019550).
Almost surely, 2200424411023 is an apocalyptic number.
200424411023 is a deficient number, since it is larger than the sum of its proper divisors (6967745377).
200424411023 is a wasteful number, since it uses less digits than its factorization.
200424411023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1885321.
The product of its (nonzero) digits is 1536, while the sum is 23.
Adding to 200424411023 its reverse (320114424002), we get a palindrome (520538835025).
The spelling of 200424411023 in words is "two hundred billion, four hundred twenty-four million, four hundred eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •