Base | Representation |
---|---|
bin | 101101100100010111100101… |
… | …000000111000001110010100 |
3 | 222021121010121212020111121020 |
4 | 231210113211000320032110 |
5 | 202232014331132231122 |
6 | 1550123404012121140 |
7 | 60133145056034340 |
oct | 5544274500701624 |
9 | 867533555214536 |
10 | 200411311211412 |
11 | 58947a61515254 |
12 | 1a58907a7661b0 |
13 | 87a9923149712 |
14 | 376bd60148620 |
15 | 18282589ecc5c |
hex | b645e5038394 |
200411311211412 has 48 divisors (see below), whose sum is σ = 534737130974592. Its totient is φ = 57227485230720.
The previous prime is 200411311211359. The next prime is 200411311211413. The reversal of 200411311211412 is 214112113114002.
It is a super-2 number, since 2×2004113112114122 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200411311211413) 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, 685048743 + ... + 685341230.
It is an arithmetic number, because the mean of its divisors is an integer number (11140356895304).
Almost surely, 2200411311211412 is an apocalyptic number.
It is an amenable number.
200411311211412 is an abundant number, since it is smaller than the sum of its proper divisors (334325819763180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200411311211412 is a wasteful number, since it uses less digits than its factorization.
200411311211412 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1370391728 (or 1370391726 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 24.
Adding to 200411311211412 its reverse (214112113114002), we get a palindrome (414523424325414).
The spelling of 200411311211412 in words is "two hundred trillion, four hundred eleven billion, three hundred eleven million, two hundred eleven thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •