Base | Representation |
---|---|
bin | 101101100001101110101111… |
… | …010011011000100110111001 |
3 | 222020221210200110121021000110 |
4 | 231201232233103120212321 |
5 | 202221032040443412203 |
6 | 1545504222455454533 |
7 | 60114066406445211 |
oct | 5541565723304671 |
9 | 866853613537013 |
10 | 200230021466553 |
11 | 5888809114a731 |
12 | 1a559b05087449 |
13 | 87957c124ac40 |
14 | 3763282d3b241 |
15 | 1823697e7cd03 |
hex | b61baf4d89b9 |
200230021466553 has 16 divisors (see below), whose sum is σ = 287529952752000. Its totient is φ = 123209826889344.
The previous prime is 200230021466551. The next prime is 200230021466617. The reversal of 200230021466553 is 355664120032002.
It is not a de Polignac number, because 200230021466553 - 21 = 200230021466551 is a prime.
It is a super-2 number, since 2×2002300214665532 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is not an unprimeable number, because it can be changed into a prime (200230021466551) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 179600901 + ... + 180712322.
It is an arithmetic number, because the mean of its divisors is an integer number (17970622047000).
Almost surely, 2200230021466553 is an apocalyptic number.
It is an amenable number.
200230021466553 is a deficient number, since it is larger than the sum of its proper divisors (87299931285447).
200230021466553 is a wasteful number, since it uses less digits than its factorization.
200230021466553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 360327488.
The product of its (nonzero) digits is 259200, while the sum is 39.
Adding to 200230021466553 its reverse (355664120032002), we get a palindrome (555894141498555).
The spelling of 200230021466553 in words is "two hundred trillion, two hundred thirty billion, twenty-one million, four hundred sixty-six thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •